./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/loop-lit/hh2012-ex3.i -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 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:08:04,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:08:04,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:08:04,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:08:04,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:08:04,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:08:04,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:08:04,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:08:04,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:08:04,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:08:04,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:08:04,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:08:04,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:08:04,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:08:04,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:08:04,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:08:04,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:08:04,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:08:04,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:08:04,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:08:04,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:08:04,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:08:04,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:08:04,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:08:04,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:08:04,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:08:04,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:08:04,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:08:04,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:08:04,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:08:04,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:08:04,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:08:04,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:08:04,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:08:04,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:08:04,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:08:04,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:08:04,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:08:04,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:08:04,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:08:04,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:08:04,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:08:04,333 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-11-08 14:08:04,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:08:04,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:08:04,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:08:04,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:08:04,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:08:04,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-08 14:08:06,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:08:06,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:08:06,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-08 14:08:06,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b7e1f58/05364066c823477e938fa6349c4c79cd/FLAG24f3aade9 [2024-11-08 14:08:06,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b7e1f58/05364066c823477e938fa6349c4c79cd [2024-11-08 14:08:06,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:08:06,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:08:06,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:08:06,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:08:06,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:08:06,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58af347f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06, skipping insertion in model container [2024-11-08 14:08:06,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:08:06,858 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-08 14:08:06,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:08:06,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:08:06,897 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-08 14:08:06,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:08:06,918 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:08:06,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06 WrapperNode [2024-11-08 14:08:06,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:08:06,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:08:06,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:08:06,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:08:06,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,951 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-11-08 14:08:06,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:08:06,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:08:06,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:08:06,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:08:06,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,975 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-08 14:08:06,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:08:06,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:08:06,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:08:06,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:08:06,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (1/1) ... [2024-11-08 14:08:06,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:08:06,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:07,013 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-08 14:08:07,017 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-08 14:08:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:08:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:08:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:08:07,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:08:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:08:07,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:08:07,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:08:07,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:08:07,234 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 14:08:07,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:08:07,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:08:07,245 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 14:08:07,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:07 BoogieIcfgContainer [2024-11-08 14:08:07,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:08:07,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:08:07,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:08:07,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:08:07,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:08:06" (1/3) ... [2024-11-08 14:08:07,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332940cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:08:07, skipping insertion in model container [2024-11-08 14:08:07,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:06" (2/3) ... [2024-11-08 14:08:07,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332940cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:08:07, skipping insertion in model container [2024-11-08 14:08:07,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:07" (3/3) ... [2024-11-08 14:08:07,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-11-08 14:08:07,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:08:07,269 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:08:07,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:08:07,323 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;@6f210043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:08:07,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:08:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:08:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:08:07,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:07,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:07,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 300894425, now seen corresponding path program 1 times [2024-11-08 14:08:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770297978] [2024-11-08 14:08:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:07,513 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-08 14:08:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770297978] [2024-11-08 14:08:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770297978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:08:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394507760] [2024-11-08 14:08:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:08:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:08:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:08:07,542 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 14:08:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:07,578 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2024-11-08 14:08:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:08:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 14:08:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:07,585 INFO L225 Difference]: With dead ends: 45 [2024-11-08 14:08:07,585 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 14:08:07,588 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-08 14:08:07,591 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 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-08 14:08:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 14:08:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 14:08:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:08:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2024-11-08 14:08:07,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2024-11-08 14:08:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:07,624 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-08 14:08:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 14:08:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2024-11-08 14:08:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:08:07,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:07,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:08:07,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 302503139, now seen corresponding path program 1 times [2024-11-08 14:08:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700945247] [2024-11-08 14:08:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:07,747 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-08 14:08:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700945247] [2024-11-08 14:08:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700945247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:07,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:08:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142769878] [2024-11-08 14:08:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:08:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:07,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:08:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:07,752 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-08 14:08:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:07,855 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-08 14:08:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-08 14:08:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:07,857 INFO L225 Difference]: With dead ends: 26 [2024-11-08 14:08:07,857 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 14:08:07,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:07,859 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 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-08 14:08:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:08:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 14:08:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 14:08:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:08:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-08 14:08:07,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2024-11-08 14:08:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:07,882 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-08 14:08:07,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-08 14:08:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-08 14:08:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 14:08:07,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:07,883 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:07,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:08:07,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:07,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1964350918, now seen corresponding path program 1 times [2024-11-08 14:08:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653786276] [2024-11-08 14:08:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:08:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653786276] [2024-11-08 14:08:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653786276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:08,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:08,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:08:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193947526] [2024-11-08 14:08:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:08,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:08:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:08:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:08,090 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:08:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:08,203 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-11-08 14:08:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:08:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-08 14:08:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:08,207 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:08:08,207 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 14:08:08,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:08:08,208 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:08,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:08:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 14:08:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-08 14:08:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 14:08:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 14:08:08,223 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2024-11-08 14:08:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:08,224 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 14:08:08,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:08:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 14:08:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:08:08,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:08,225 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:08,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:08:08,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:08,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1092746621, now seen corresponding path program 1 times [2024-11-08 14:08:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836808029] [2024-11-08 14:08:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 14:08:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836808029] [2024-11-08 14:08:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836808029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:08,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:08,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:08:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278544329] [2024-11-08 14:08:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:08,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:08:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:08,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:08:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:08,406 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:08:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:08,495 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-11-08 14:08:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:08:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-08 14:08:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:08,496 INFO L225 Difference]: With dead ends: 46 [2024-11-08 14:08:08,497 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 14:08:08,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:08:08,498 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:08,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:08:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 14:08:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-08 14:08:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 14:08:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-08 14:08:08,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2024-11-08 14:08:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:08,509 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-08 14:08:08,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:08:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-08 14:08:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 14:08:08,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:08,510 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:08:08,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 961880998, now seen corresponding path program 1 times [2024-11-08 14:08:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678993533] [2024-11-08 14:08:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:08:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678993533] [2024-11-08 14:08:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678993533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:08:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424997091] [2024-11-08 14:08:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:08,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:08:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:08:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:08,632 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 14:08:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:08,703 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-11-08 14:08:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-11-08 14:08:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:08,707 INFO L225 Difference]: With dead ends: 89 [2024-11-08 14:08:08,707 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 14:08:08,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:08,708 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:08,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 14:08:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 14:08:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 14:08:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-08 14:08:08,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2024-11-08 14:08:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-08 14:08:08,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 14:08:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-08 14:08:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 14:08:08,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:08,731 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:08:08,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1962382770, now seen corresponding path program 1 times [2024-11-08 14:08:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913328727] [2024-11-08 14:08:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:08:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:08:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:08:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:08:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 14:08:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913328727] [2024-11-08 14:08:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913328727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:08:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907773449] [2024-11-08 14:08:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:08:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:08,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:08:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:08:08,901 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 14:08:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:08,946 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-08 14:08:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:08:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2024-11-08 14:08:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:08,948 INFO L225 Difference]: With dead ends: 62 [2024-11-08 14:08:08,948 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 14:08:08,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:08,952 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:08,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 14:08:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 14:08:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 14:08:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-11-08 14:08:08,974 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2024-11-08 14:08:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:08,974 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-11-08 14:08:08,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 14:08:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-11-08 14:08:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 14:08:08,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:08,977 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:08,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:08:08,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -896370565, now seen corresponding path program 1 times [2024-11-08 14:08:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025462310] [2024-11-08 14:08:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:08:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:08:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:08:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:08:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:08:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:08:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 14:08:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 14:08:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:08:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 14:08:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:08:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025462310] [2024-11-08 14:08:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025462310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:08:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480187181] [2024-11-08 14:08:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:09,125 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-08 14:08:09,127 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-08 14:08:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:09,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 14:08:09,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:08:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-08 14:08:09,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:08:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:08:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480187181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:08:09,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:08:09,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 14:08:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173866603] [2024-11-08 14:08:09,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:08:09,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:08:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:08:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:09,407 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-08 14:08:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:09,479 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2024-11-08 14:08:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 78 [2024-11-08 14:08:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:09,483 INFO L225 Difference]: With dead ends: 126 [2024-11-08 14:08:09,483 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 14:08:09,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:09,484 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:09,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:08:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 14:08:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 14:08:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 14:08:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-08 14:08:09,500 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 78 [2024-11-08 14:08:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:09,500 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-08 14:08:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-08 14:08:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-08 14:08:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 14:08:09,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:09,504 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:09,523 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-08 14:08:09,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:09,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:09,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1496774405, now seen corresponding path program 2 times [2024-11-08 14:08:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139939172] [2024-11-08 14:08:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:08:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:08:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:08:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:08:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:08:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:08:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 14:08:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 14:08:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:08:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:08:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:08:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:08:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:08:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 14:08:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 14:08:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 14:08:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:08:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:08:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-11-08 14:08:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139939172] [2024-11-08 14:08:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139939172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:08:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368326374] [2024-11-08 14:08:10,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:08:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:10,168 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-08 14:08:10,170 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-08 14:08:10,250 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:08:10,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:08:10,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 14:08:10,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:08:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 14:08:10,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:08:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-11-08 14:08:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368326374] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 14:08:10,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:08:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-11-08 14:08:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074896557] [2024-11-08 14:08:10,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:10,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:08:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:08:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-08 14:08:10,888 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 14:08:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:10,979 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2024-11-08 14:08:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 120 [2024-11-08 14:08:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:10,983 INFO L225 Difference]: With dead ends: 86 [2024-11-08 14:08:10,983 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 14:08:10,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-08 14:08:10,984 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:10,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:08:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 14:08:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 14:08:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 14:08:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-08 14:08:11,020 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 120 [2024-11-08 14:08:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:11,024 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-08 14:08:11,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 14:08:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-08 14:08:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 14:08:11,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:11,031 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:11,049 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-08 14:08:11,232 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,SelfDestructingSolverStorable7 [2024-11-08 14:08:11,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:11,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1777971090, now seen corresponding path program 3 times [2024-11-08 14:08:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:11,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285980348] [2024-11-08 14:08:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:08:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:08:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:08:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:08:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:08:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:08:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 14:08:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 14:08:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:08:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:08:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:08:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:08:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:08:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 14:08:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 14:08:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 14:08:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:08:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:08:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 14:08:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 14:08:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285980348] [2024-11-08 14:08:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285980348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:08:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055019507] [2024-11-08 14:08:11,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:08:11,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:11,532 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-08 14:08:11,533 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-08 14:08:11,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:08:11,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:08:11,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:08:11,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:08:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-11-08 14:08:11,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:08:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055019507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:08:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-08 14:08:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88869730] [2024-11-08 14:08:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:11,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:08:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:08:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:08:11,674 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:08:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:11,740 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2024-11-08 14:08:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-08 14:08:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:11,742 INFO L225 Difference]: With dead ends: 98 [2024-11-08 14:08:11,742 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 14:08:11,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:08:11,743 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:11,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 14:08:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 14:08:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 14:08:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2024-11-08 14:08:11,762 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 125 [2024-11-08 14:08:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2024-11-08 14:08:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:08:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2024-11-08 14:08:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 14:08:11,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:11,766 INFO L215 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:11,787 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-08 14:08:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:11,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 40082412, now seen corresponding path program 4 times [2024-11-08 14:08:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156847378] [2024-11-08 14:08:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:08:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:08:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:08:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:08:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:08:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:08:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:08:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:08:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 14:08:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 14:08:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:08:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:08:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:08:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:08:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:08:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 14:08:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 14:08:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 14:08:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:08:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:08:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 14:08:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 14:08:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 14:08:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 14:08:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 14:08:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 56 proven. 70 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-11-08 14:08:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156847378] [2024-11-08 14:08:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156847378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:08:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926192889] [2024-11-08 14:08:12,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 14:08:12,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:12,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:12,280 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-08 14:08:12,282 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-08 14:08:12,349 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 14:08:12,349 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:08:12,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 14:08:12,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:08:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 77 proven. 52 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 14:08:12,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:08:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 52 proven. 73 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2024-11-08 14:08:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926192889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:08:12,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:08:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-11-08 14:08:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051386796] [2024-11-08 14:08:12,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:08:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 14:08:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 14:08:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:08:12,823 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-08 14:08:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:13,351 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2024-11-08 14:08:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 14:08:13,351 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) Word has length 146 [2024-11-08 14:08:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:13,352 INFO L225 Difference]: With dead ends: 161 [2024-11-08 14:08:13,352 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 14:08:13,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 329 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 14:08:13,358 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:13,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 143 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:08:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 14:08:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 14:08:13,359 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-08 14:08:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 14:08:13,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2024-11-08 14:08:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:13,359 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 14:08:13,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-08 14:08:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 14:08:13,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 14:08:13,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:08:13,381 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-08 14:08:13,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:08:13,570 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:13,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 14:08:14,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:08:14,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:08:14 BoogieIcfgContainer [2024-11-08 14:08:14,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:08:14,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:08:14,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:08:14,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:08:14,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:07" (3/4) ... [2024-11-08 14:08:14,376 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 14:08:14,381 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-08 14:08:14,384 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 14:08:14,385 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 14:08:14,385 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 14:08:14,385 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 14:08:14,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:08:14,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 14:08:14,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:08:14,475 INFO L158 Benchmark]: Toolchain (without parser) took 7829.11ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 155.4MB in the beginning and 104.8MB in the end (delta: 50.5MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,476 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:08:14,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 142.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 186.6MB. Free memory was 142.5MB in the beginning and 141.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,476 INFO L158 Benchmark]: Boogie Preprocessor took 31.45ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,477 INFO L158 Benchmark]: RCFGBuilder took 261.04ms. Allocated memory is still 186.6MB. Free memory was 139.3MB in the beginning and 155.3MB in the end (delta: -16.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,477 INFO L158 Benchmark]: TraceAbstraction took 7124.21ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 154.3MB in the beginning and 109.0MB in the end (delta: 45.3MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,477 INFO L158 Benchmark]: Witness Printer took 101.33ms. Allocated memory is still 224.4MB. Free memory was 109.0MB in the beginning and 104.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:08:14,478 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.11ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 142.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 186.6MB. Free memory was 142.5MB in the beginning and 141.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.45ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.04ms. Allocated memory is still 186.6MB. Free memory was 139.3MB in the beginning and 155.3MB in the end (delta: -16.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7124.21ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 154.3MB in the beginning and 109.0MB in the end (delta: 45.3MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 101.33ms. Allocated memory is still 224.4MB. Free memory was 109.0MB in the beginning and 104.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 234 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1101 GetRequests, 981 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1379 ConstructedInterpolants, 0 QuantifiedInterpolants, 2355 SizeOfPredicates, 4 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 9996/10307 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: 16]: Loop Invariant Derived loop invariant: ((i <= 4) && (0 <= i)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((i <= 3) && (0 <= i)) && (j == 0)) || ((((j <= 4) && (1 <= j)) && (i <= ((long long) 3 + j))) && (j <= i))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-08 14:08:14,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE