./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.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 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:22:54,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:22:54,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:22:54,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:22:54,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:22:54,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:22:54,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:22:54,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:22:54,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:22:54,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:22:54,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:22:54,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:22:54,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:22:54,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:22:54,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:22:54,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:22:54,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:22:54,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:22:54,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:22:54,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:22:54,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:22:54,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:22:54,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:22:54,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:22:54,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:22:54,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:22:54,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:22:54,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:22:54,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:22:54,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:22:54,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:22:54,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:22:54,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:22:54,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:22:54,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:22:54,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:22:54,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:22:54,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:22:54,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:22:54,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:22:54,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:22:54,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:22:54,463 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 -> 898ef25fdb2ae04f56304d500631f410c196b9a77fbfba6f83248dcfc33b301f [2024-11-09 22:22:54,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:22:54,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:22:54,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:22:54,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:22:54,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:22:54,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2024-11-09 22:22:56,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:22:56,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:22:56,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c [2024-11-09 22:22:56,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c1293a2/edecba5fe6a640d1b8cd6e589b16e588/FLAG16b6c7ff2 [2024-11-09 22:22:56,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c1293a2/edecba5fe6a640d1b8cd6e589b16e588 [2024-11-09 22:22:56,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:22:56,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:22:56,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:22:56,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:22:56,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:22:56,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362fb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56, skipping insertion in model container [2024-11-09 22:22:56,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:22:56,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c[739,752] [2024-11-09 22:22:56,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:22:56,681 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:22:56,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1_abstracted.c[739,752] [2024-11-09 22:22:56,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:22:56,722 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:22:56,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56 WrapperNode [2024-11-09 22:22:56,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:22:56,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:22:56,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:22:56,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:22:56,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,752 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-11-09 22:22:56,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:22:56,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:22:56,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:22:56,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:22:56,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,785 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:22:56,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:22:56,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:22:56,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:22:56,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:22:56,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (1/1) ... [2024-11-09 22:22:56,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:22:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:22:56,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:22:56,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:22:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:22:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:22:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:22:56,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:22:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:22:56,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:22:56,946 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:22:56,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:22:57,135 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:22:57,135 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:22:57,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:22:57,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:22:57,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:22:57 BoogieIcfgContainer [2024-11-09 22:22:57,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:22:57,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:22:57,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:22:57,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:22:57,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:56" (1/3) ... [2024-11-09 22:22:57,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793c4086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:57, skipping insertion in model container [2024-11-09 22:22:57,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:56" (2/3) ... [2024-11-09 22:22:57,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793c4086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:57, skipping insertion in model container [2024-11-09 22:22:57,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:22:57" (3/3) ... [2024-11-09 22:22:57,161 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3-1_abstracted.c [2024-11-09 22:22:57,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:22:57,176 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:22:57,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:22:57,228 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;@152473d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:22:57,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:22:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:22:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 22:22:57,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:57,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:57,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1379845673, now seen corresponding path program 1 times [2024-11-09 22:22:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25749509] [2024-11-09 22:22:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:57,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25749509] [2024-11-09 22:22:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25749509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:22:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:22:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:22:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96947060] [2024-11-09 22:22:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:22:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:22:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:22:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:22:57,417 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:57,437 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2024-11-09 22:22:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:22:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 22:22:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:57,445 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:22:57,445 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:22:57,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:22:57,451 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:57,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:22:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:22:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:22:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-09 22:22:57,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 8 [2024-11-09 22:22:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:57,485 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 22:22:57,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-09 22:22:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:22:57,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:57,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:57,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:22:57,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:57,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1518119545, now seen corresponding path program 1 times [2024-11-09 22:22:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564893478] [2024-11-09 22:22:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564893478] [2024-11-09 22:22:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564893478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:22:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:22:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:22:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887156471] [2024-11-09 22:22:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:22:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:22:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:22:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,594 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:57,614 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-09 22:22:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:22:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 22:22:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:57,616 INFO L225 Difference]: With dead ends: 42 [2024-11-09 22:22:57,616 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:22:57,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,617 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:57,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:22:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:22:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2024-11-09 22:22:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-09 22:22:57,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 9 [2024-11-09 22:22:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:57,625 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-09 22:22:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-09 22:22:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:22:57,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:57,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:57,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:22:57,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 317001002, now seen corresponding path program 1 times [2024-11-09 22:22:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715150795] [2024-11-09 22:22:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715150795] [2024-11-09 22:22:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715150795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:22:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:22:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:22:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549612594] [2024-11-09 22:22:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:22:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:22:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:22:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,708 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:57,728 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-11-09 22:22:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:22:57,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 22:22:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:57,732 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:22:57,732 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:22:57,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,733 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:57,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:22:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:22:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-09 22:22:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-09 22:22:57,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2024-11-09 22:22:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:57,742 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-09 22:22:57,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-09 22:22:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 22:22:57,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:57,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:57,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:22:57,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:57,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2021619657, now seen corresponding path program 1 times [2024-11-09 22:22:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762766755] [2024-11-09 22:22:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762766755] [2024-11-09 22:22:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762766755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:22:57,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:22:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:22:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582998275] [2024-11-09 22:22:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:22:57,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:22:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:22:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,866 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:57,883 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-09 22:22:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:22:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 22:22:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:57,885 INFO L225 Difference]: With dead ends: 48 [2024-11-09 22:22:57,885 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 22:22:57,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:22:57,888 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:57,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:22:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 22:22:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 22:22:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 22:22:57,899 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2024-11-09 22:22:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 22:22:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-09 22:22:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 22:22:57,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:57,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:22:57,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:57,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 94286828, now seen corresponding path program 1 times [2024-11-09 22:22:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919716505] [2024-11-09 22:22:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919716505] [2024-11-09 22:22:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919716505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:22:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:22:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:22:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237750515] [2024-11-09 22:22:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:22:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:22:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:22:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:22:58,145 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:58,265 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-09 22:22:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:22:58,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 22:22:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:58,268 INFO L225 Difference]: With dead ends: 54 [2024-11-09 22:22:58,268 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:22:58,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:22:58,270 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:58,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:22:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:22:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 22:22:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 22:22:58,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2024-11-09 22:22:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:58,281 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 22:22:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:22:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 22:22:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 22:22:58,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:58,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:22:58,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2048495081, now seen corresponding path program 1 times [2024-11-09 22:22:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43202693] [2024-11-09 22:22:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:58,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:22:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43202693] [2024-11-09 22:22:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43202693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:22:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171237312] [2024-11-09 22:22:58,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:58,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:22:58,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:22:58,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:22:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:22:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:58,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:22:58,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:22:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:58,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:22:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:22:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171237312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:22:58,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:22:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-11-09 22:22:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481768991] [2024-11-09 22:22:58,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:22:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:22:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:22:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:22:58,749 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:58,883 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2024-11-09 22:22:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:22:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 22:22:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:58,885 INFO L225 Difference]: With dead ends: 87 [2024-11-09 22:22:58,885 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 22:22:58,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:22:58,886 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:58,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 312 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:22:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 22:22:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-11-09 22:22:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:22:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-09 22:22:58,905 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2024-11-09 22:22:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:58,908 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-09 22:22:58,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:22:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-09 22:22:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 22:22:58,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:58,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:58,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:22:59,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 22:22:59,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:59,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2101271428, now seen corresponding path program 2 times [2024-11-09 22:22:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785593311] [2024-11-09 22:22:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:59,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:22:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:22:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:22:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:22:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:22:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785593311] [2024-11-09 22:22:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785593311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:22:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889950523] [2024-11-09 22:22:59,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:22:59,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:22:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:22:59,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:22:59,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:22:59,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:22:59,302 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:22:59,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:22:59,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:22:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:22:59,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:22:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:22:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889950523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:22:59,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:22:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 22:22:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408594785] [2024-11-09 22:22:59,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:22:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:22:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:22:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:22:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:22:59,446 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:22:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:22:59,553 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 22:22:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:22:59,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-11-09 22:22:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:22:59,555 INFO L225 Difference]: With dead ends: 130 [2024-11-09 22:22:59,555 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 22:22:59,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:22:59,559 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:22:59,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:22:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 22:22:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 22:22:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 22:22:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-11-09 22:22:59,581 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 35 [2024-11-09 22:22:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:22:59,582 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-11-09 22:22:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:22:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-11-09 22:22:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 22:22:59,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:22:59,586 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:22:59,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:22:59,786 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,SelfDestructingSolverStorable6 [2024-11-09 22:22:59,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:22:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:22:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2010141128, now seen corresponding path program 3 times [2024-11-09 22:22:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:22:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668525410] [2024-11-09 22:22:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:22:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:22:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:23:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:23:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:23:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:23:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:23:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 22:23:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 22:23:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:23:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668525410] [2024-11-09 22:23:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668525410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:23:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576165350] [2024-11-09 22:23:00,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:23:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:23:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:23:00,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:23:00,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:23:00,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 22:23:00,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:23:00,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:23:00,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:23:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-09 22:23:00,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:23:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576165350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:23:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:23:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-09 22:23:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988973210] [2024-11-09 22:23:00,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:23:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:23:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:23:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:23:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:23:00,389 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:23:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:23:00,527 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-09 22:23:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:23:00,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-09 22:23:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:23:00,529 INFO L225 Difference]: With dead ends: 90 [2024-11-09 22:23:00,529 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:23:00,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:23:00,532 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:23:00,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:23:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:23:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-11-09 22:23:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:23:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-09 22:23:00,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 83 [2024-11-09 22:23:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:23:00,553 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-09 22:23:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:23:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-09 22:23:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 22:23:00,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:23:00,556 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:23:00,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:23:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:23:00,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:23:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:23:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1603702559, now seen corresponding path program 1 times [2024-11-09 22:23:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:23:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915927068] [2024-11-09 22:23:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:23:00,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:23:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:23:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:23:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:23:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:23:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:23:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 22:23:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 22:23:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 16 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 22:23:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:23:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915927068] [2024-11-09 22:23:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915927068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:23:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748788589] [2024-11-09 22:23:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:23:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:23:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:23:01,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:23:01,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:23:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:01,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:23:01,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:23:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 14 proven. 54 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 22:23:01,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:23:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 22:23:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748788589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:23:01,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:23:01,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2024-11-09 22:23:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632848400] [2024-11-09 22:23:01,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:23:01,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 22:23:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:23:01,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 22:23:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:23:01,487 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 22:23:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:23:02,204 INFO L93 Difference]: Finished difference Result 358 states and 409 transitions. [2024-11-09 22:23:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 22:23:02,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 91 [2024-11-09 22:23:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:23:02,207 INFO L225 Difference]: With dead ends: 358 [2024-11-09 22:23:02,207 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 22:23:02,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 22:23:02,209 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 258 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:23:02,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 798 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:23:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 22:23:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 266. [2024-11-09 22:23:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 230 states have (on average 1.0217391304347827) internal successors, (235), 230 states have internal predecessors, (235), 33 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 22:23:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 300 transitions. [2024-11-09 22:23:02,267 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 300 transitions. Word has length 91 [2024-11-09 22:23:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:23:02,268 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 300 transitions. [2024-11-09 22:23:02,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 22:23:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 300 transitions. [2024-11-09 22:23:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-09 22:23:02,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:23:02,277 INFO L215 NwaCegarLoop]: trace histogram [33, 32, 32, 32, 28, 28, 28, 28, 28, 28, 28, 28, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:23:02,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:23:02,481 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-11-09 22:23:02,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:23:02,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:23:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash 555055395, now seen corresponding path program 2 times [2024-11-09 22:23:02,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:23:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062182339] [2024-11-09 22:23:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:23:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:23:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:23:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:23:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:23:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:23:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:23:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 22:23:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:23:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 22:23:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:23:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 22:23:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 22:23:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 22:23:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 22:23:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 22:23:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-09 22:23:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 22:23:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 22:23:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-09 22:23:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-09 22:23:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-09 22:23:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-09 22:23:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-09 22:23:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-09 22:23:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-09 22:23:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-09 22:23:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-11-09 22:23:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-09 22:23:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-09 22:23:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-09 22:23:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-09 22:23:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-09 22:23:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-09 22:23:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5340 backedges. 1338 proven. 182 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2024-11-09 22:23:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:23:03,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062182339] [2024-11-09 22:23:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062182339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:23:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349151840] [2024-11-09 22:23:03,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:23:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:23:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:23:03,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:23:03,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:23:03,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:23:03,330 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:23:03,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 22:23:03,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:23:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5340 backedges. 64 proven. 2722 refuted. 0 times theorem prover too weak. 2554 trivial. 0 not checked. [2024-11-09 22:23:03,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:23:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5340 backedges. 166 proven. 2620 refuted. 0 times theorem prover too weak. 2554 trivial. 0 not checked. [2024-11-09 22:23:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349151840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:23:04,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:23:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-11-09 22:23:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732717392] [2024-11-09 22:23:04,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:23:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 22:23:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:23:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 22:23:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2024-11-09 22:23:04,705 INFO L87 Difference]: Start difference. First operand 266 states and 300 transitions. Second operand has 30 states, 30 states have (on average 7.6) internal successors, (228), 30 states have internal predecessors, (228), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2024-11-09 22:23:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:23:07,720 INFO L93 Difference]: Finished difference Result 982 states and 1132 transitions. [2024-11-09 22:23:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-09 22:23:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 30 states have internal predecessors, (228), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) Word has length 385 [2024-11-09 22:23:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:23:07,725 INFO L225 Difference]: With dead ends: 982 [2024-11-09 22:23:07,725 INFO L226 Difference]: Without dead ends: 778 [2024-11-09 22:23:07,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2157, Invalid=10499, Unknown=0, NotChecked=0, Total=12656 [2024-11-09 22:23:07,731 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 514 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:23:07,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 3599 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:23:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-09 22:23:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 718. [2024-11-09 22:23:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 624 states have (on average 1.017628205128205) internal successors, (635), 624 states have internal predecessors, (635), 91 states have call successors, (91), 3 states have call predecessors, (91), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-09 22:23:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 816 transitions. [2024-11-09 22:23:07,838 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 816 transitions. Word has length 385 [2024-11-09 22:23:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:23:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 816 transitions. [2024-11-09 22:23:07,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 30 states have internal predecessors, (228), 24 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2024-11-09 22:23:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 816 transitions. [2024-11-09 22:23:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2024-11-09 22:23:07,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:23:07,867 INFO L215 NwaCegarLoop]: trace histogram [91, 90, 90, 90, 80, 80, 80, 80, 80, 80, 80, 80, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:23:07,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:23:08,070 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-11-09 22:23:08,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:23:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:23:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 696689039, now seen corresponding path program 3 times [2024-11-09 22:23:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:23:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231026464] [2024-11-09 22:23:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:23:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:23:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 22:23:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:23:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:23:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:23:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:23:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 22:23:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:23:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 22:23:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 22:23:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 22:23:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 22:23:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 22:23:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 22:23:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 22:23:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-09 22:23:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-09 22:23:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-09 22:23:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 22:23:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-09 22:23:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-09 22:23:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-09 22:23:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-09 22:23:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-09 22:23:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-09 22:23:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-09 22:23:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-09 22:23:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-09 22:23:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-09 22:23:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-09 22:23:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-09 22:23:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-09 22:23:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-09 22:23:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2024-11-09 22:23:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-09 22:23:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2024-11-09 22:23:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-09 22:23:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2024-11-09 22:23:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2024-11-09 22:23:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-11-09 22:23:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-11-09 22:23:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-11-09 22:23:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 494 [2024-11-09 22:23:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2024-11-09 22:23:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-11-09 22:23:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-11-09 22:23:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-09 22:23:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-09 22:23:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-09 22:23:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-09 22:23:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-09 22:23:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-09 22:23:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2024-11-09 22:23:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 624 [2024-11-09 22:23:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2024-11-09 22:23:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2024-11-09 22:23:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-11-09 22:23:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2024-11-09 22:23:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2024-11-09 22:23:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 694 [2024-11-09 22:23:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 706 [2024-11-09 22:23:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-09 22:23:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2024-11-09 22:23:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 738 [2024-11-09 22:23:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 752 [2024-11-09 22:23:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2024-11-09 22:23:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 776 [2024-11-09 22:23:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2024-11-09 22:23:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 800 [2024-11-09 22:23:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 812 [2024-11-09 22:23:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 824 [2024-11-09 22:23:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 836 [2024-11-09 22:23:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 844 [2024-11-09 22:23:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 858 [2024-11-09 22:23:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-09 22:23:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 882 [2024-11-09 22:23:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 894 [2024-11-09 22:23:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 906 [2024-11-09 22:23:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 918 [2024-11-09 22:23:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2024-11-09 22:23:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 942 [2024-11-09 22:23:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 950 [2024-11-09 22:23:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 964 [2024-11-09 22:23:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 976 [2024-11-09 22:23:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 988 [2024-11-09 22:23:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1000 [2024-11-09 22:23:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1012 [2024-11-09 22:23:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1024 [2024-11-09 22:23:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1036 [2024-11-09 22:23:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1048 [2024-11-09 22:23:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1056 [2024-11-09 22:23:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:23:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 43370 backedges. 5114 proven. 240 refuted. 0 times theorem prover too weak. 38016 trivial. 0 not checked. [2024-11-09 22:23:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:23:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231026464] [2024-11-09 22:23:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231026464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:23:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491057347] [2024-11-09 22:23:09,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:23:09,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:23:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:23:09,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:23:09,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:23:10,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 22:23:10,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:23:10,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:23:10,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:23:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 43370 backedges. 5132 proven. 0 refuted. 0 times theorem prover too weak. 38238 trivial. 0 not checked. [2024-11-09 22:23:10,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:23:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491057347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:23:10,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:23:10,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-09 22:23:10,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788279101] [2024-11-09 22:23:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:23:10,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:23:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:23:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:23:10,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:23:10,421 INFO L87 Difference]: Start difference. First operand 718 states and 816 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:23:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:23:10,590 INFO L93 Difference]: Finished difference Result 718 states and 816 transitions. [2024-11-09 22:23:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:23:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 1069 [2024-11-09 22:23:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:23:10,594 INFO L225 Difference]: With dead ends: 718 [2024-11-09 22:23:10,594 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 22:23:10,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:23:10,596 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:23:10,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 125 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:23:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 22:23:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 22:23:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:23:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 22:23:10,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1069 [2024-11-09 22:23:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:23:10,598 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 22:23:10,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:23:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 22:23:10,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 22:23:10,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:23:10,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:23:10,805 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-11-09 22:23:10,810 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2024-11-09 22:23:10,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 22:23:14,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:23:14,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:23:14 BoogieIcfgContainer [2024-11-09 22:23:14,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:23:14,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:23:14,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:23:14,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:23:14,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:22:57" (3/4) ... [2024-11-09 22:23:14,682 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 22:23:14,685 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 22:23:14,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 22:23:14,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 22:23:14,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 22:23:14,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 22:23:14,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:23:14,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 22:23:14,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:23:14,776 INFO L158 Benchmark]: Toolchain (without parser) took 18340.14ms. Allocated memory was 157.3MB in the beginning and 432.0MB in the end (delta: 274.7MB). Free memory was 110.5MB in the beginning and 288.0MB in the end (delta: -177.5MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,776 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:23:14,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.59ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 97.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 96.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:23:14,777 INFO L158 Benchmark]: Boogie Preprocessor took 41.89ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,777 INFO L158 Benchmark]: IcfgBuilder took 352.60ms. Allocated memory is still 157.3MB. Free memory was 94.7MB in the beginning and 120.5MB in the end (delta: -25.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,777 INFO L158 Benchmark]: TraceAbstraction took 17526.15ms. Allocated memory was 157.3MB in the beginning and 432.0MB in the end (delta: 274.7MB). Free memory was 120.0MB in the beginning and 293.2MB in the end (delta: -173.3MB). Peak memory consumption was 258.7MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,778 INFO L158 Benchmark]: Witness Printer took 97.06ms. Allocated memory is still 432.0MB. Free memory was 293.2MB in the beginning and 288.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 22:23:14,779 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.16ms. Allocated memory is still 100.7MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.59ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 97.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 96.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.89ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 352.60ms. Allocated memory is still 157.3MB. Free memory was 94.7MB in the beginning and 120.5MB in the end (delta: -25.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17526.15ms. Allocated memory was 157.3MB in the beginning and 432.0MB in the end (delta: 274.7MB). Free memory was 120.0MB in the beginning and 293.2MB in the end (delta: -173.3MB). Peak memory consumption was 258.7MB. Max. memory is 16.1GB. * Witness Printer took 97.06ms. Allocated memory is still 432.0MB. Free memory was 293.2MB in the beginning and 288.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 11, TraceHistogramMax: 91, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 5401 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4755 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2450 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 646 mSDtfsCounter, 2450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2687 GetRequests, 2474 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4891 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=10, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 125 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3427 NumberOfCodeBlocks, 2317 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3940 ConstructedInterpolants, 4 QuantifiedInterpolants, 8231 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 97808/103936 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: null - InvariantResult [Line: 32]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (((cond < 0) || (2 < cond)) || (cond == 1)) Ensures: (((cond < 0) || (2 < cond)) || (cond == 1)) RESULT: Ultimate proved your program to be correct! [2024-11-09 22:23:14,810 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 Result: TRUE