./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.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 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:52:25,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:52:25,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:52:25,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:52:25,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:52:25,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:52:25,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:52:25,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:52:25,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:52:25,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:52:25,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:52:25,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:52:25,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:52:25,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:52:25,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:52:25,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:52:25,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:52:25,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:52:25,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:52:25,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:52:25,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:52:25,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:52:25,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:52:25,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:52:25,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:52:25,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:52:25,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:52:25,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:52:25,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:52:25,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:52:25,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:52:25,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:52:25,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:52:25,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:52:25,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:52:25,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:52:25,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:52:25,993 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 -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2024-10-12 18:52:26,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:52:26,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:52:26,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:52:26,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:52:26,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:52:26,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-10-12 18:52:27,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:52:27,875 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:52:27,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-10-12 18:52:27,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec46ddfbc/d41806e9dde94b1d9e5f944215160ed7/FLAGcf28b1160 [2024-10-12 18:52:27,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec46ddfbc/d41806e9dde94b1d9e5f944215160ed7 [2024-10-12 18:52:27,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:52:27,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:52:27,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:52:27,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:52:27,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:52:27,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:52:27" (1/1) ... [2024-10-12 18:52:27,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3b26fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:27, skipping insertion in model container [2024-10-12 18:52:27,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:52:27" (1/1) ... [2024-10-12 18:52:27,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:52:28,076 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-10-12 18:52:28,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:52:28,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:52:28,122 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-10-12 18:52:28,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:52:28,152 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:52:28,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28 WrapperNode [2024-10-12 18:52:28,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:52:28,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:52:28,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:52:28,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:52:28,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,211 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-12 18:52:28,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:52:28,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:52:28,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:52:28,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:52:28,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,253 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:52:28,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:52:28,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:52:28,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:52:28,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:52:28,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (1/1) ... [2024-10-12 18:52:28,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:52:28,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:28,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:52:28,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:52:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:52:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:52:28,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:52:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:52:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:52:28,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:52:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:52:28,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:52:28,412 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:52:28,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:52:28,557 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-12 18:52:28,557 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:52:28,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:52:28,584 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 18:52:28,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:52:28 BoogieIcfgContainer [2024-10-12 18:52:28,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:52:28,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:52:28,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:52:28,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:52:28,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:52:27" (1/3) ... [2024-10-12 18:52:28,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545be50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:52:28, skipping insertion in model container [2024-10-12 18:52:28,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:52:28" (2/3) ... [2024-10-12 18:52:28,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545be50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:52:28, skipping insertion in model container [2024-10-12 18:52:28,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:52:28" (3/3) ... [2024-10-12 18:52:28,593 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2024-10-12 18:52:28,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:52:28,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:52:28,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:52:28,662 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;@5ad21d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:52:28,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:52:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:52:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:52:28,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:28,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:28,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-12 18:52:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513451500] [2024-10-12 18:52:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513451500] [2024-10-12 18:52:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513451500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:52:28,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954268263] [2024-10-12 18:52:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:28,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:52:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:52:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:52:28,883 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:52:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:28,908 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-12 18:52:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:52:28,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-12 18:52:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:28,915 INFO L225 Difference]: With dead ends: 56 [2024-10-12 18:52:28,915 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 18:52:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:52:28,921 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:28,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 18:52:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 18:52:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:52:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-12 18:52:28,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-12 18:52:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:28,954 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-12 18:52:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:52:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-12 18:52:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:52:28,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:28,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:52:28,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-12 18:52:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251782386] [2024-10-12 18:52:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251782386] [2024-10-12 18:52:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251782386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:52:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900464890] [2024-10-12 18:52:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:52:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:52:29,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:52:29,168 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:52:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:29,205 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-12 18:52:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:52:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-12 18:52:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:29,207 INFO L225 Difference]: With dead ends: 36 [2024-10-12 18:52:29,208 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:52:29,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:52:29,210 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:29,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:52:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 18:52:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:52:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-12 18:52:29,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-12 18:52:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:29,220 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-12 18:52:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:52:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-12 18:52:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:52:29,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:29,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:52:29,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-12 18:52:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423416965] [2024-10-12 18:52:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:52:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477993417] [2024-10-12 18:52:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:29,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:29,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:29,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:52:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:29,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:52:29,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:29,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:52:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423416965] [2024-10-12 18:52:29,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:52:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477993417] [2024-10-12 18:52:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477993417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:29,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:52:29,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549603168] [2024-10-12 18:52:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:52:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:52:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:52:29,587 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:52:33,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:52:35,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:52:39,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:52:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:39,839 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-12 18:52:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:52:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-12 18:52:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:39,843 INFO L225 Difference]: With dead ends: 48 [2024-10-12 18:52:39,843 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 18:52:39,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:52:39,846 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:39,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2024-10-12 18:52:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 18:52:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-12 18:52:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 18:52:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-12 18:52:39,867 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-12 18:52:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:39,867 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-12 18:52:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:52:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-12 18:52:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:52:39,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:39,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:39,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:52:40,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:40,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-12 18:52:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225620161] [2024-10-12 18:52:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:40,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225620161] [2024-10-12 18:52:40,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225620161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44164796] [2024-10-12 18:52:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:40,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:40,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:40,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:52:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:40,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:52:40,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:40,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44164796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:40,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-12 18:52:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584669320] [2024-10-12 18:52:40,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:40,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:52:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:52:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:52:40,685 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 18:52:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:40,812 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-12 18:52:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:52:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-12 18:52:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:40,814 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:52:40,814 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 18:52:40,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:52:40,816 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:40,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:52:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 18:52:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-12 18:52:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 18:52:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-12 18:52:40,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 24 [2024-10-12 18:52:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:40,849 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-12 18:52:40,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 18:52:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-12 18:52:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:52:40,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:40,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:40,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:52:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:52:41,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-12 18:52:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165873113] [2024-10-12 18:52:41,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165873113] [2024-10-12 18:52:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165873113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:52:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552923998] [2024-10-12 18:52:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:52:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:52:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:52:41,135 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:52:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:41,188 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-12 18:52:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:52:41,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-12 18:52:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:41,196 INFO L225 Difference]: With dead ends: 92 [2024-10-12 18:52:41,196 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:52:41,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:52:41,198 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:41,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:52:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 18:52:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 18:52:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-12 18:52:41,214 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 30 [2024-10-12 18:52:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-12 18:52:41,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:52:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-12 18:52:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:52:41,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:41,216 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:41,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:52:41,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-12 18:52:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088130709] [2024-10-12 18:52:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:52:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088130709] [2024-10-12 18:52:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088130709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:52:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869581431] [2024-10-12 18:52:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:52:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:52:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:52:41,315 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:52:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:41,375 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2024-10-12 18:52:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:52:41,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-10-12 18:52:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:41,377 INFO L225 Difference]: With dead ends: 101 [2024-10-12 18:52:41,377 INFO L226 Difference]: Without dead ends: 64 [2024-10-12 18:52:41,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:52:41,382 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:41,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-12 18:52:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-12 18:52:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 18:52:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-12 18:52:41,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 36 [2024-10-12 18:52:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:41,403 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-12 18:52:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:52:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-12 18:52:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:52:41,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:41,405 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:41,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:52:41,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:41,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:41,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-12 18:52:41,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:41,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698046959] [2024-10-12 18:52:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:52:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:41,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698046959] [2024-10-12 18:52:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698046959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132661052] [2024-10-12 18:52:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:41,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:41,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:41,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:52:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:41,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:52:41,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:41,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:52:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132661052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:41,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-10-12 18:52:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994661999] [2024-10-12 18:52:41,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:52:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:52:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:52:41,738 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-12 18:52:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:41,923 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2024-10-12 18:52:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:52:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 38 [2024-10-12 18:52:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:41,925 INFO L225 Difference]: With dead ends: 169 [2024-10-12 18:52:41,925 INFO L226 Difference]: Without dead ends: 132 [2024-10-12 18:52:41,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:52:41,926 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:41,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 181 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:52:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-12 18:52:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2024-10-12 18:52:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 88 states have internal predecessors, (108), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 18:52:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2024-10-12 18:52:41,967 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 38 [2024-10-12 18:52:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:41,967 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2024-10-12 18:52:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-12 18:52:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2024-10-12 18:52:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 18:52:41,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:41,969 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:52:42,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:42,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-12 18:52:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648495504] [2024-10-12 18:52:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 18:52:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648495504] [2024-10-12 18:52:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648495504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:52:42,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:52:42,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:52:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850277301] [2024-10-12 18:52:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:52:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:52:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:52:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:52:42,244 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:52:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:42,302 INFO L93 Difference]: Finished difference Result 173 states and 223 transitions. [2024-10-12 18:52:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:52:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-12 18:52:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:42,305 INFO L225 Difference]: With dead ends: 173 [2024-10-12 18:52:42,307 INFO L226 Difference]: Without dead ends: 118 [2024-10-12 18:52:42,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:52:42,308 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:42,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 111 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-12 18:52:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2024-10-12 18:52:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.225) internal successors, (98), 81 states have internal predecessors, (98), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 18:52:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2024-10-12 18:52:42,342 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 42 [2024-10-12 18:52:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:42,343 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2024-10-12 18:52:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:52:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2024-10-12 18:52:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 18:52:42,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:42,345 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:42,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:52:42,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:42,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-12 18:52:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:42,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541067710] [2024-10-12 18:52:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 18:52:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541067710] [2024-10-12 18:52:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541067710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122142348] [2024-10-12 18:52:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:42,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:42,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:52:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:42,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:52:42,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:42,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 18:52:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122142348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:42,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 14 [2024-10-12 18:52:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928583749] [2024-10-12 18:52:42,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 18:52:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 18:52:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-12 18:52:42,775 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-12 18:52:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:43,012 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2024-10-12 18:52:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 18:52:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 44 [2024-10-12 18:52:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:43,015 INFO L225 Difference]: With dead ends: 218 [2024-10-12 18:52:43,015 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 18:52:43,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:52:43,018 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:43,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 213 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:52:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 18:52:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2024-10-12 18:52:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.238938053097345) internal successors, (140), 114 states have internal predecessors, (140), 28 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 18:52:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2024-10-12 18:52:43,056 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 44 [2024-10-12 18:52:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:43,056 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2024-10-12 18:52:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-12 18:52:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2024-10-12 18:52:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 18:52:43,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:43,061 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:43,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:52:43,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:43,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-12 18:52:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214516441] [2024-10-12 18:52:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:52:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:52:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214516441] [2024-10-12 18:52:43,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214516441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746369964] [2024-10-12 18:52:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:43,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:43,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:43,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:43,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:52:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:43,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:52:43,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:43,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:52:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746369964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:43,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:43,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-12 18:52:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387383716] [2024-10-12 18:52:43,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:43,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:52:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:52:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:52:43,719 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-12 18:52:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:43,997 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2024-10-12 18:52:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 18:52:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 50 [2024-10-12 18:52:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:44,002 INFO L225 Difference]: With dead ends: 210 [2024-10-12 18:52:44,002 INFO L226 Difference]: Without dead ends: 205 [2024-10-12 18:52:44,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:52:44,003 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 127 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:44,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 215 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:52:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-12 18:52:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2024-10-12 18:52:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 150 states have internal predecessors, (180), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-12 18:52:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 255 transitions. [2024-10-12 18:52:44,074 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 255 transitions. Word has length 50 [2024-10-12 18:52:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:44,075 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 255 transitions. [2024-10-12 18:52:44,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-12 18:52:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 255 transitions. [2024-10-12 18:52:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 18:52:44,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:44,077 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:44,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:52:44,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 18:52:44,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1904373439, now seen corresponding path program 1 times [2024-10-12 18:52:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624827714] [2024-10-12 18:52:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:52:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:52:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 18:52:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 18:52:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 18:52:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-12 18:52:44,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624827714] [2024-10-12 18:52:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624827714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164199548] [2024-10-12 18:52:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:44,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:44,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:44,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:52:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:44,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:52:44,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-12 18:52:44,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-12 18:52:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164199548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:44,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-12 18:52:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516876269] [2024-10-12 18:52:44,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:52:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:52:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:52:44,647 INFO L87 Difference]: Start difference. First operand 197 states and 255 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-12 18:52:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:44,765 INFO L93 Difference]: Finished difference Result 490 states and 678 transitions. [2024-10-12 18:52:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:52:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 86 [2024-10-12 18:52:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:44,768 INFO L225 Difference]: With dead ends: 490 [2024-10-12 18:52:44,768 INFO L226 Difference]: Without dead ends: 354 [2024-10-12 18:52:44,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:52:44,769 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:44,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 191 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:52:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-12 18:52:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2024-10-12 18:52:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 256 states have (on average 1.2578125) internal successors, (322), 262 states have internal predecessors, (322), 72 states have call successors, (72), 13 states have call predecessors, (72), 12 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-12 18:52:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 465 transitions. [2024-10-12 18:52:44,831 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 465 transitions. Word has length 86 [2024-10-12 18:52:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:44,831 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 465 transitions. [2024-10-12 18:52:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-12 18:52:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 465 transitions. [2024-10-12 18:52:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 18:52:44,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:44,834 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:44,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:52:45,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:45,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:45,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1715119347, now seen corresponding path program 2 times [2024-10-12 18:52:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983233653] [2024-10-12 18:52:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:52:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:52:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 18:52:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 18:52:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 18:52:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 18:52:45,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983233653] [2024-10-12 18:52:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983233653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264872179] [2024-10-12 18:52:45,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:52:45,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:45,311 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-10-12 18:52:45,312 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-10-12 18:52:45,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:52:45,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:52:45,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:52:45,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:52:45,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 18:52:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264872179] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:45,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 16 [2024-10-12 18:52:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382869809] [2024-10-12 18:52:45,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:52:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:52:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:52:45,651 INFO L87 Difference]: Start difference. First operand 341 states and 465 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-12 18:52:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:45,930 INFO L93 Difference]: Finished difference Result 470 states and 644 transitions. [2024-10-12 18:52:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 18:52:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) Word has length 86 [2024-10-12 18:52:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:45,933 INFO L225 Difference]: With dead ends: 470 [2024-10-12 18:52:45,933 INFO L226 Difference]: Without dead ends: 351 [2024-10-12 18:52:45,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 181 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:52:45,935 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 75 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:45,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 194 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:52:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-12 18:52:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2024-10-12 18:52:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 264 states have (on average 1.2121212121212122) internal successors, (320), 264 states have internal predecessors, (320), 70 states have call successors, (70), 13 states have call predecessors, (70), 12 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-12 18:52:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 459 transitions. [2024-10-12 18:52:45,999 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 459 transitions. Word has length 86 [2024-10-12 18:52:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:46,000 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 459 transitions. [2024-10-12 18:52:46,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-12 18:52:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2024-10-12 18:52:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 18:52:46,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:46,002 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:46,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:52:46,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:46,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1117496236, now seen corresponding path program 1 times [2024-10-12 18:52:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743481187] [2024-10-12 18:52:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:52:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:52:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:52:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 18:52:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 18:52:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:52:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:52:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 18:52:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 18:52:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 18:52:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 18:52:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-12 18:52:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:52:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743481187] [2024-10-12 18:52:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743481187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:52:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193020085] [2024-10-12 18:52:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:46,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:46,495 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-10-12 18:52:46,496 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-10-12 18:52:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:52:46,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 18:52:46,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:52:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:52:46,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:52:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-12 18:52:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193020085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:52:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:52:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 15 [2024-10-12 18:52:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133276111] [2024-10-12 18:52:46,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:52:46,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 18:52:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:52:46,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 18:52:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:52:46,856 INFO L87 Difference]: Start difference. First operand 347 states and 459 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-12 18:52:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:52:47,119 INFO L93 Difference]: Finished difference Result 456 states and 620 transitions. [2024-10-12 18:52:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:52:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 92 [2024-10-12 18:52:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:52:47,122 INFO L225 Difference]: With dead ends: 456 [2024-10-12 18:52:47,123 INFO L226 Difference]: Without dead ends: 345 [2024-10-12 18:52:47,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 193 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:52:47,124 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 95 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:52:47,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 171 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:52:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-12 18:52:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-10-12 18:52:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 262 states have internal predecessors, (313), 70 states have call successors, (70), 13 states have call predecessors, (70), 12 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-12 18:52:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 452 transitions. [2024-10-12 18:52:47,202 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 452 transitions. Word has length 92 [2024-10-12 18:52:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:52:47,203 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 452 transitions. [2024-10-12 18:52:47,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-12 18:52:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 452 transitions. [2024-10-12 18:52:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 18:52:47,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:52:47,205 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:47,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 18:52:47,405 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,SelfDestructingSolverStorable12 [2024-10-12 18:52:47,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:52:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:52:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash -32862541, now seen corresponding path program 1 times [2024-10-12 18:52:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:52:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465250952] [2024-10-12 18:52:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:52:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:52:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186843898] [2024-10-12 18:52:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:52:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:52:47,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:52:47,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:52:47,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 18:52:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:52:47,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:52:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:52:47,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:52:47,568 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:52:47,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:52:47,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 18:52:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 18:52:47,773 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:52:47,826 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:52:47,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:52:47 BoogieIcfgContainer [2024-10-12 18:52:47,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:52:47,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:52:47,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:52:47,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:52:47,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:52:28" (3/4) ... [2024-10-12 18:52:47,831 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:52:47,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:52:47,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:52:47,893 INFO L158 Benchmark]: Toolchain (without parser) took 19993.67ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 81.5MB in the beginning and 121.0MB in the end (delta: -39.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:52:47,893 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:52:47,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.81ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 68.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.87ms. Allocated memory is still 151.0MB. Free memory was 68.6MB in the beginning and 123.6MB in the end (delta: -55.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,894 INFO L158 Benchmark]: Boogie Preprocessor took 53.47ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 121.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,894 INFO L158 Benchmark]: RCFGBuilder took 319.14ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 108.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,894 INFO L158 Benchmark]: TraceAbstraction took 19241.80ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 108.3MB in the beginning and 125.3MB in the end (delta: -17.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,895 INFO L158 Benchmark]: Witness Printer took 62.68ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 121.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:52:47,896 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.15ms. Allocated memory is still 111.1MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.81ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 68.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.87ms. Allocated memory is still 151.0MB. Free memory was 68.6MB in the beginning and 123.6MB in the end (delta: -55.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.47ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 121.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.14ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 108.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19241.80ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 108.3MB in the beginning and 125.3MB in the end (delta: -17.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 62.68ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 121.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=7, R=2, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=7, R=2, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=7, counter=0, r=-3, u=5, v=1] [L34] EXPR counter++ VAL [A=7, counter=1, r=-3, u=5, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=1, r=-3, u=5, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=7, counter=1, r=-3, u=5, v=1] [L39] EXPR counter++ VAL [A=7, counter=2, r=-3, u=5, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=2, r=-3, u=5, v=1] [L41] COND TRUE !(r > 0) VAL [A=7, counter=2, r=-3, u=5, v=1] [L47] EXPR counter++ VAL [A=7, counter=3, r=-3, u=5, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=3, r=-3, u=5, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=7, counter=3, r=2, u=7, v=1] [L47] EXPR counter++ VAL [A=7, counter=4, r=2, u=7, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=4, r=2, u=7, v=1] [L49] COND TRUE !(r < 0) VAL [A=7, counter=4, r=2, u=7, v=1] [L34] EXPR counter++ VAL [A=7, counter=5, r=2, u=7, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=5, r=2, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=7, counter=5, r=2, u=7, v=1] [L39] EXPR counter++ VAL [A=7, counter=6, r=2, u=7, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=6, r=2, u=7, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=7, counter=6, r=1, u=7, v=3] [L39] EXPR counter++ VAL [A=7, counter=7, r=1, u=7, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=7, r=1, u=7, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=7, counter=7, r=-2, u=7, v=5] [L39] EXPR counter++ VAL [A=7, counter=8, r=-2, u=7, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=8, r=-2, u=7, v=5] [L41] COND TRUE !(r > 0) VAL [A=7, counter=8, r=-2, u=7, v=5] [L47] EXPR counter++ VAL [A=7, counter=9, r=-2, u=7, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=9, r=-2, u=7, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=7, counter=9, r=5, u=9, v=5] [L47] EXPR counter++ VAL [A=7, counter=10, r=5, u=9, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=10, r=5, u=9, v=5] [L49] COND TRUE !(r < 0) VAL [A=7, counter=10, r=5, u=9, v=5] [L34] EXPR counter++ VAL [A=7, counter=11, r=5, u=9, v=5] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 1795 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1359 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 436 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 940 SyntacticMatches, 20 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=12, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 70 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1394 ConstructedInterpolants, 0 QuantifiedInterpolants, 3045 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1491/2044 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 18:52:47,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE