./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:53:40,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:53:40,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:53:40,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:53:40,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:53:40,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:53:40,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:53:40,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:53:40,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:53:40,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:53:40,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:53:40,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:53:40,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:53:40,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:53:40,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:53:40,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:53:40,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:53:40,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:53:40,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:53:40,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:53:40,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:53:40,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:53:40,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:53:40,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:53:40,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:53:40,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:53:40,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:53:40,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:53:40,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:53:40,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:53:40,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:53:40,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:53:40,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:53:40,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:53:40,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:53:40,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:53:40,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:53:40,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:53:40,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:53:40,386 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2024-11-11 23:53:40,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:53:40,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:53:40,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:53:40,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:53:40,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:53:40,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-11 23:53:41,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:53:42,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:53:42,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-11 23:53:42,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/557a62495/2e76744c43b44e95958a08b5c673ece1/FLAG95f0b0819 [2024-11-11 23:53:42,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/557a62495/2e76744c43b44e95958a08b5c673ece1 [2024-11-11 23:53:42,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:53:42,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:53:42,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:53:42,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:53:42,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:53:42,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbff249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42, skipping insertion in model container [2024-11-11 23:53:42,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:53:42,659 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-11 23:53:42,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:53:42,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:53:42,734 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-11 23:53:42,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:53:42,772 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:53:42,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42 WrapperNode [2024-11-11 23:53:42,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:53:42,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:53:42,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:53:42,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:53:42,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,838 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2024-11-11 23:53:42,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:53:42,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:53:42,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:53:42,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:53:42,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,887 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-11 23:53:42,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:53:42,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:53:42,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:53:42,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:53:42,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (1/1) ... [2024-11-11 23:53:42,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:53:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:53:42,964 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-11 23:53:42,967 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-11 23:53:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:53:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:53:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:53:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:53:43,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:53:43,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:53:43,590 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-11-11 23:53:43,590 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:53:43,605 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:53:43,606 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:53:43,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:53:43 BoogieIcfgContainer [2024-11-11 23:53:43,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:53:43,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:53:43,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:53:43,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:53:43,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:53:42" (1/3) ... [2024-11-11 23:53:43,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da568f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:53:43, skipping insertion in model container [2024-11-11 23:53:43,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:42" (2/3) ... [2024-11-11 23:53:43,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da568f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:53:43, skipping insertion in model container [2024-11-11 23:53:43,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:53:43" (3/3) ... [2024-11-11 23:53:43,614 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2024-11-11 23:53:43,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:53:43,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:53:43,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:53:43,694 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;@66c4de19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:53:43,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:53:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 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-11 23:53:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 23:53:43,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:43,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:43,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2024-11-11 23:53:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256263160] [2024-11-11 23:53:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:43,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:44,106 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-11 23:53:44,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256263160] [2024-11-11 23:53:44,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256263160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:44,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:53:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143181053] [2024-11-11 23:53:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:53:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:53:44,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:53:44,137 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 23:53:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:44,184 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2024-11-11 23:53:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:53:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2024-11-11 23:53:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:44,195 INFO L225 Difference]: With dead ends: 149 [2024-11-11 23:53:44,195 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 23:53:44,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:53:44,202 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:44,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 23:53:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-11 23:53:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 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-11 23:53:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-11-11 23:53:44,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 13 [2024-11-11 23:53:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:44,240 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-11-11 23:53:44,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 23:53:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-11-11 23:53:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 23:53:44,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:44,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:44,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:53:44,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:44,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2024-11-11 23:53:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768549466] [2024-11-11 23:53:44,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:44,364 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-11 23:53:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768549466] [2024-11-11 23:53:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768549466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:53:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675266788] [2024-11-11 23:53:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:53:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:53:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:53:44,394 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11 23:53:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:44,455 INFO L93 Difference]: Finished difference Result 150 states and 215 transitions. [2024-11-11 23:53:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:53:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2024-11-11 23:53:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:44,457 INFO L225 Difference]: With dead ends: 150 [2024-11-11 23:53:44,457 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 23:53:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:53:44,458 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 23:53:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-11 23:53:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 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-11 23:53:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-11 23:53:44,474 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 14 [2024-11-11 23:53:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:44,475 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-11 23:53:44,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11 23:53:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-11 23:53:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 23:53:44,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:44,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:44,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:53:44,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:44,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2024-11-11 23:53:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:44,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133264912] [2024-11-11 23:53:44,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:44,736 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-11 23:53:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133264912] [2024-11-11 23:53:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133264912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:53:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329155654] [2024-11-11 23:53:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:44,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:53:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:53:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:53:44,738 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 23:53:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:44,839 INFO L93 Difference]: Finished difference Result 209 states and 298 transitions. [2024-11-11 23:53:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:53:44,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 15 [2024-11-11 23:53:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:44,841 INFO L225 Difference]: With dead ends: 209 [2024-11-11 23:53:44,841 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 23:53:44,841 INFO L434 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-11 23:53:44,842 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 88 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 480 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 23:53:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2024-11-11 23:53:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 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-11 23:53:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-11 23:53:44,853 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 15 [2024-11-11 23:53:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:44,853 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-11 23:53:44,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 23:53:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-11 23:53:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 23:53:44,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:44,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:44,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:53:44,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 675925806, now seen corresponding path program 1 times [2024-11-11 23:53:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99729611] [2024-11-11 23:53:44,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:45,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99729611] [2024-11-11 23:53:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99729611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:53:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627702093] [2024-11-11 23:53:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:53:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:53:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:53:45,204 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11 23:53:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:45,288 INFO L93 Difference]: Finished difference Result 154 states and 218 transitions. [2024-11-11 23:53:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:53:45,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) Word has length 50 [2024-11-11 23:53:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:45,290 INFO L225 Difference]: With dead ends: 154 [2024-11-11 23:53:45,290 INFO L226 Difference]: Without dead ends: 83 [2024-11-11 23:53:45,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:45,291 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 96 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:45,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 155 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-11 23:53:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-11 23:53:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 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-11 23:53:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2024-11-11 23:53:45,295 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 50 [2024-11-11 23:53:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2024-11-11 23:53:45,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11 23:53:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2024-11-11 23:53:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 23:53:45,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:45,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:53:45,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1297469558, now seen corresponding path program 1 times [2024-11-11 23:53:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076487053] [2024-11-11 23:53:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076487053] [2024-11-11 23:53:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076487053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:45,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:53:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492503215] [2024-11-11 23:53:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:45,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:53:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:53:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:53:45,538 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11 23:53:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:45,633 INFO L93 Difference]: Finished difference Result 209 states and 294 transitions. [2024-11-11 23:53:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:53:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) Word has length 51 [2024-11-11 23:53:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:45,635 INFO L225 Difference]: With dead ends: 209 [2024-11-11 23:53:45,636 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 23:53:45,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:53:45,638 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 304 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:45,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 276 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 23:53:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2024-11-11 23:53:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 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-11 23:53:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-11 23:53:45,650 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 51 [2024-11-11 23:53:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:45,651 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-11 23:53:45,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11 23:53:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-11 23:53:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 23:53:45,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:45,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 23:53:45,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:45,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1748200073, now seen corresponding path program 1 times [2024-11-11 23:53:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300998952] [2024-11-11 23:53:45,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300998952] [2024-11-11 23:53:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300998952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:53:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093671478] [2024-11-11 23:53:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:53:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:53:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:45,951 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-11 23:53:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:46,070 INFO L93 Difference]: Finished difference Result 209 states and 293 transitions. [2024-11-11 23:53:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:53:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) Word has length 52 [2024-11-11 23:53:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:46,071 INFO L225 Difference]: With dead ends: 209 [2024-11-11 23:53:46,072 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 23:53:46,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:46,073 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 246 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:46,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 213 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 23:53:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 105. [2024-11-11 23:53:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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-11 23:53:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-11 23:53:46,078 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 52 [2024-11-11 23:53:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-11 23:53:46,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-11 23:53:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-11 23:53:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 23:53:46,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:46,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:46,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 23:53:46,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 404626969, now seen corresponding path program 1 times [2024-11-11 23:53:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803253303] [2024-11-11 23:53:46,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803253303] [2024-11-11 23:53:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803253303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:53:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229079364] [2024-11-11 23:53:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:53:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:53:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:53:46,415 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-11 23:53:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:46,519 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2024-11-11 23:53:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 23:53:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2024-11-11 23:53:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:46,522 INFO L225 Difference]: With dead ends: 239 [2024-11-11 23:53:46,522 INFO L226 Difference]: Without dead ends: 109 [2024-11-11 23:53:46,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:53:46,523 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 72 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:46,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 674 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-11 23:53:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-11 23:53:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 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-11 23:53:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-11-11 23:53:46,528 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 53 [2024-11-11 23:53:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-11-11 23:53:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-11 23:53:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-11-11 23:53:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 23:53:46,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:46,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 23:53:46,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1816946855, now seen corresponding path program 1 times [2024-11-11 23:53:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065304551] [2024-11-11 23:53:46,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065304551] [2024-11-11 23:53:47,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065304551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:47,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:47,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 23:53:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448383993] [2024-11-11 23:53:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:53:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:53:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:53:47,205 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-11 23:53:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:47,409 INFO L93 Difference]: Finished difference Result 297 states and 414 transitions. [2024-11-11 23:53:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 23:53:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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) Word has length 54 [2024-11-11 23:53:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:47,411 INFO L225 Difference]: With dead ends: 297 [2024-11-11 23:53:47,411 INFO L226 Difference]: Without dead ends: 146 [2024-11-11 23:53:47,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-11 23:53:47,412 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 174 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:47,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 747 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-11 23:53:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2024-11-11 23:53:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 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-11 23:53:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-11-11 23:53:47,423 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 54 [2024-11-11 23:53:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:47,423 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-11-11 23:53:47,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-11 23:53:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-11-11 23:53:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 23:53:47,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:47,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:47,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 23:53:47,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:47,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1700046524, now seen corresponding path program 1 times [2024-11-11 23:53:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618900189] [2024-11-11 23:53:47,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618900189] [2024-11-11 23:53:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618900189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 23:53:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254511489] [2024-11-11 23:53:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:47,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 23:53:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 23:53:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 23:53:47,700 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11 23:53:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:47,708 INFO L93 Difference]: Finished difference Result 189 states and 259 transitions. [2024-11-11 23:53:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 23:53:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2024-11-11 23:53:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:47,712 INFO L225 Difference]: With dead ends: 189 [2024-11-11 23:53:47,712 INFO L226 Difference]: Without dead ends: 116 [2024-11-11 23:53:47,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 23:53:47,713 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:47,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-11 23:53:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-11 23:53:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 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-11 23:53:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2024-11-11 23:53:47,720 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 156 transitions. Word has length 55 [2024-11-11 23:53:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 156 transitions. [2024-11-11 23:53:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11 23:53:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2024-11-11 23:53:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 23:53:47,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:47,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:47,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 23:53:47,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -725395541, now seen corresponding path program 1 times [2024-11-11 23:53:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603418262] [2024-11-11 23:53:47,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:48,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603418262] [2024-11-11 23:53:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603418262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:48,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:48,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:53:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40418262] [2024-11-11 23:53:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:48,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:53:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:53:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:48,024 INFO L87 Difference]: Start difference. First operand 116 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11 23:53:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:48,077 INFO L93 Difference]: Finished difference Result 215 states and 294 transitions. [2024-11-11 23:53:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:53:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 56 [2024-11-11 23:53:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:48,078 INFO L225 Difference]: With dead ends: 215 [2024-11-11 23:53:48,079 INFO L226 Difference]: Without dead ends: 142 [2024-11-11 23:53:48,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:48,080 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 222 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:48,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 287 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-11 23:53:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2024-11-11 23:53:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 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-11 23:53:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2024-11-11 23:53:48,088 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 56 [2024-11-11 23:53:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:48,088 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2024-11-11 23:53:48,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11 23:53:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2024-11-11 23:53:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 23:53:48,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:48,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:48,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 23:53:48,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -766759353, now seen corresponding path program 1 times [2024-11-11 23:53:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228236551] [2024-11-11 23:53:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228236551] [2024-11-11 23:53:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228236551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:53:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481104661] [2024-11-11 23:53:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:53:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:53:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:48,463 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-11 23:53:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:48,545 INFO L93 Difference]: Finished difference Result 322 states and 441 transitions. [2024-11-11 23:53:48,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 23:53:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) Word has length 56 [2024-11-11 23:53:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:48,547 INFO L225 Difference]: With dead ends: 322 [2024-11-11 23:53:48,547 INFO L226 Difference]: Without dead ends: 249 [2024-11-11 23:53:48,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:53:48,547 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 119 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:48,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 944 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-11 23:53:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 170. [2024-11-11 23:53:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.3609467455621302) internal successors, (230), 169 states have internal predecessors, (230), 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-11 23:53:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2024-11-11 23:53:48,552 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 56 [2024-11-11 23:53:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:48,552 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2024-11-11 23:53:48,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-11 23:53:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2024-11-11 23:53:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 23:53:48,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:48,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:48,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 23:53:48,553 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -341597152, now seen corresponding path program 1 times [2024-11-11 23:53:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729461923] [2024-11-11 23:53:48,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729461923] [2024-11-11 23:53:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729461923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 23:53:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142903156] [2024-11-11 23:53:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:53:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:53:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:53:48,966 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-11 23:53:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:49,152 INFO L93 Difference]: Finished difference Result 302 states and 409 transitions. [2024-11-11 23:53:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 23:53:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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) Word has length 57 [2024-11-11 23:53:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:49,154 INFO L225 Difference]: With dead ends: 302 [2024-11-11 23:53:49,154 INFO L226 Difference]: Without dead ends: 206 [2024-11-11 23:53:49,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-11 23:53:49,154 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 245 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:49,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-11 23:53:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2024-11-11 23:53:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 186 states have internal predecessors, (251), 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-11 23:53:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 251 transitions. [2024-11-11 23:53:49,159 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 251 transitions. Word has length 57 [2024-11-11 23:53:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:49,159 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 251 transitions. [2024-11-11 23:53:49,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-11 23:53:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 251 transitions. [2024-11-11 23:53:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 23:53:49,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:49,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:49,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 23:53:49,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1703158141, now seen corresponding path program 1 times [2024-11-11 23:53:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291639116] [2024-11-11 23:53:49,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291639116] [2024-11-11 23:53:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291639116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:53:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128040243] [2024-11-11 23:53:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:53:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:53:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:53:49,443 INFO L87 Difference]: Start difference. First operand 187 states and 251 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-11 23:53:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:49,500 INFO L93 Difference]: Finished difference Result 347 states and 467 transitions. [2024-11-11 23:53:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:53:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) Word has length 57 [2024-11-11 23:53:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:49,501 INFO L225 Difference]: With dead ends: 347 [2024-11-11 23:53:49,501 INFO L226 Difference]: Without dead ends: 191 [2024-11-11 23:53:49,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:53:49,502 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 96 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:49,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 391 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-11 23:53:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-11 23:53:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.3421052631578947) internal successors, (255), 190 states have internal predecessors, (255), 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-11 23:53:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 255 transitions. [2024-11-11 23:53:49,507 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 255 transitions. Word has length 57 [2024-11-11 23:53:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 255 transitions. [2024-11-11 23:53:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-11 23:53:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 255 transitions. [2024-11-11 23:53:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 23:53:49,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:49,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 23:53:49,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1758386272, now seen corresponding path program 1 times [2024-11-11 23:53:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561618015] [2024-11-11 23:53:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561618015] [2024-11-11 23:53:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561618015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 23:53:50,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758657735] [2024-11-11 23:53:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:50,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:53:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:53:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:53:50,326 INFO L87 Difference]: Start difference. First operand 191 states and 255 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-11 23:53:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:50,637 INFO L93 Difference]: Finished difference Result 353 states and 471 transitions. [2024-11-11 23:53:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 23:53:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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) Word has length 58 [2024-11-11 23:53:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:50,639 INFO L225 Difference]: With dead ends: 353 [2024-11-11 23:53:50,639 INFO L226 Difference]: Without dead ends: 235 [2024-11-11 23:53:50,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 23:53:50,639 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:50,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 543 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:53:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-11 23:53:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2024-11-11 23:53:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 219 states have internal predecessors, (291), 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-11 23:53:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 291 transitions. [2024-11-11 23:53:50,644 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 291 transitions. Word has length 58 [2024-11-11 23:53:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:50,644 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 291 transitions. [2024-11-11 23:53:50,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-11 23:53:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 291 transitions. [2024-11-11 23:53:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 23:53:50,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:50,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:50,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 23:53:50,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:50,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -300843303, now seen corresponding path program 1 times [2024-11-11 23:53:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163793869] [2024-11-11 23:53:50,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163793869] [2024-11-11 23:53:50,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163793869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:50,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:53:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406463365] [2024-11-11 23:53:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:50,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:53:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:53:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:50,805 INFO L87 Difference]: Start difference. First operand 220 states and 291 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-11 23:53:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:50,859 INFO L93 Difference]: Finished difference Result 336 states and 449 transitions. [2024-11-11 23:53:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:53:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) Word has length 59 [2024-11-11 23:53:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:50,860 INFO L225 Difference]: With dead ends: 336 [2024-11-11 23:53:50,861 INFO L226 Difference]: Without dead ends: 228 [2024-11-11 23:53:50,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:50,863 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 102 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:50,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 242 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-11 23:53:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-11 23:53:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 227 states have internal predecessors, (299), 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-11 23:53:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 299 transitions. [2024-11-11 23:53:50,867 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 299 transitions. Word has length 59 [2024-11-11 23:53:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 299 transitions. [2024-11-11 23:53:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-11 23:53:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 299 transitions. [2024-11-11 23:53:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 23:53:50,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:50,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 23:53:50,869 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:50,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1208663187, now seen corresponding path program 1 times [2024-11-11 23:53:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640591334] [2024-11-11 23:53:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:51,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640591334] [2024-11-11 23:53:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640591334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 23:53:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841759342] [2024-11-11 23:53:51,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 23:53:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 23:53:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:53:51,514 INFO L87 Difference]: Start difference. First operand 228 states and 299 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-11 23:53:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:51,722 INFO L93 Difference]: Finished difference Result 379 states and 501 transitions. [2024-11-11 23:53:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 23:53:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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) Word has length 59 [2024-11-11 23:53:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:51,723 INFO L225 Difference]: With dead ends: 379 [2024-11-11 23:53:51,723 INFO L226 Difference]: Without dead ends: 272 [2024-11-11 23:53:51,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-11 23:53:51,724 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 122 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:51,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 690 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:53:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-11 23:53:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2024-11-11 23:53:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 249 states have internal predecessors, (328), 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-11 23:53:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 328 transitions. [2024-11-11 23:53:51,729 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 328 transitions. Word has length 59 [2024-11-11 23:53:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 328 transitions. [2024-11-11 23:53:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-11 23:53:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2024-11-11 23:53:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 23:53:51,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:51,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 23:53:51,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1956754481, now seen corresponding path program 1 times [2024-11-11 23:53:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158372021] [2024-11-11 23:53:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158372021] [2024-11-11 23:53:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158372021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:53:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448095483] [2024-11-11 23:53:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:53:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:53:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:52,170 INFO L87 Difference]: Start difference. First operand 250 states and 328 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-11 23:53:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:52,328 INFO L93 Difference]: Finished difference Result 384 states and 505 transitions. [2024-11-11 23:53:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:53:52,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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) Word has length 59 [2024-11-11 23:53:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:52,330 INFO L225 Difference]: With dead ends: 384 [2024-11-11 23:53:52,330 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 23:53:52,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:52,331 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 52 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:52,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 410 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 23:53:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 258. [2024-11-11 23:53:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.3151750972762646) internal successors, (338), 257 states have internal predecessors, (338), 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-11 23:53:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 338 transitions. [2024-11-11 23:53:52,336 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 338 transitions. Word has length 59 [2024-11-11 23:53:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:52,336 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 338 transitions. [2024-11-11 23:53:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-11 23:53:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 338 transitions. [2024-11-11 23:53:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 23:53:52,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:52,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 23:53:52,337 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1387066297, now seen corresponding path program 1 times [2024-11-11 23:53:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90058539] [2024-11-11 23:53:52,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90058539] [2024-11-11 23:53:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90058539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 23:53:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849150482] [2024-11-11 23:53:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:53:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:53:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:53:53,055 INFO L87 Difference]: Start difference. First operand 258 states and 338 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-11 23:53:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:53,221 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2024-11-11 23:53:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 23:53:53,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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) Word has length 60 [2024-11-11 23:53:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:53,223 INFO L225 Difference]: With dead ends: 383 [2024-11-11 23:53:53,223 INFO L226 Difference]: Without dead ends: 260 [2024-11-11 23:53:53,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-11 23:53:53,223 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 197 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 433 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-11 23:53:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-11 23:53:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.3127413127413128) internal successors, (340), 259 states have internal predecessors, (340), 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-11 23:53:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 340 transitions. [2024-11-11 23:53:53,228 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 340 transitions. Word has length 60 [2024-11-11 23:53:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 340 transitions. [2024-11-11 23:53:53,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-11 23:53:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 340 transitions. [2024-11-11 23:53:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 23:53:53,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:53,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:53,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 23:53:53,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 707521011, now seen corresponding path program 1 times [2024-11-11 23:53:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144115007] [2024-11-11 23:53:53,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144115007] [2024-11-11 23:53:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144115007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:53,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:53,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:53:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303498598] [2024-11-11 23:53:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:53,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:53:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:53:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:53,677 INFO L87 Difference]: Start difference. First operand 260 states and 340 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-11 23:53:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:53,761 INFO L93 Difference]: Finished difference Result 447 states and 593 transitions. [2024-11-11 23:53:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 23:53:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) Word has length 60 [2024-11-11 23:53:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:53,762 INFO L225 Difference]: With dead ends: 447 [2024-11-11 23:53:53,763 INFO L226 Difference]: Without dead ends: 345 [2024-11-11 23:53:53,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:53:53,763 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 95 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:53,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 772 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-11 23:53:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 204. [2024-11-11 23:53:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 203 states have internal predecessors, (266), 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-11 23:53:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 266 transitions. [2024-11-11 23:53:53,768 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 266 transitions. Word has length 60 [2024-11-11 23:53:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 266 transitions. [2024-11-11 23:53:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-11 23:53:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 266 transitions. [2024-11-11 23:53:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 23:53:53,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:53,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:53,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 23:53:53,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1629672575, now seen corresponding path program 1 times [2024-11-11 23:53:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122105574] [2024-11-11 23:53:53,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122105574] [2024-11-11 23:53:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122105574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:54,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:54,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:53:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379422785] [2024-11-11 23:53:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:53:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:53:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:54,005 INFO L87 Difference]: Start difference. First operand 204 states and 266 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-11 23:53:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:54,057 INFO L93 Difference]: Finished difference Result 318 states and 419 transitions. [2024-11-11 23:53:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:53:54,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Word has length 60 [2024-11-11 23:53:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:54,059 INFO L225 Difference]: With dead ends: 318 [2024-11-11 23:53:54,059 INFO L226 Difference]: Without dead ends: 178 [2024-11-11 23:53:54,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11 23:53:54,059 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 55 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:54,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 378 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-11 23:53:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-11 23:53:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.305084745762712) internal successors, (231), 177 states have internal predecessors, (231), 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-11 23:53:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 231 transitions. [2024-11-11 23:53:54,064 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 231 transitions. Word has length 60 [2024-11-11 23:53:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:54,064 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 231 transitions. [2024-11-11 23:53:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-11 23:53:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 231 transitions. [2024-11-11 23:53:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 23:53:54,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:54,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 23:53:54,066 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 636172103, now seen corresponding path program 1 times [2024-11-11 23:53:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663318406] [2024-11-11 23:53:54,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663318406] [2024-11-11 23:53:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663318406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:53:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232168366] [2024-11-11 23:53:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:54,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:53:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:53:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:54,543 INFO L87 Difference]: Start difference. First operand 178 states and 231 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-11 23:53:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:54,704 INFO L93 Difference]: Finished difference Result 261 states and 343 transitions. [2024-11-11 23:53:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:53:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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) Word has length 61 [2024-11-11 23:53:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:54,705 INFO L225 Difference]: With dead ends: 261 [2024-11-11 23:53:54,705 INFO L226 Difference]: Without dead ends: 178 [2024-11-11 23:53:54,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:53:54,706 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 43 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:54,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 416 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-11 23:53:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-11 23:53:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 177 states have internal predecessors, (230), 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-11 23:53:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 230 transitions. [2024-11-11 23:53:54,710 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 230 transitions. Word has length 61 [2024-11-11 23:53:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:54,710 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 230 transitions. [2024-11-11 23:53:54,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-11 23:53:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 230 transitions. [2024-11-11 23:53:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 23:53:54,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:54,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:54,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 23:53:54,711 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1324893726, now seen corresponding path program 1 times [2024-11-11 23:53:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:54,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501170370] [2024-11-11 23:53:54,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:55,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501170370] [2024-11-11 23:53:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501170370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:53:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166792809] [2024-11-11 23:53:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:53:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:55,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:53:55,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:53:55,073 INFO L87 Difference]: Start difference. First operand 178 states and 230 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-11 23:53:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:55,230 INFO L93 Difference]: Finished difference Result 284 states and 371 transitions. [2024-11-11 23:53:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:53:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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) Word has length 62 [2024-11-11 23:53:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:55,231 INFO L225 Difference]: With dead ends: 284 [2024-11-11 23:53:55,231 INFO L226 Difference]: Without dead ends: 174 [2024-11-11 23:53:55,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 23:53:55,232 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 215 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:55,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 350 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:53:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-11 23:53:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-11 23:53:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2890173410404624) internal successors, (223), 173 states have internal predecessors, (223), 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-11 23:53:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 223 transitions. [2024-11-11 23:53:55,236 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 223 transitions. Word has length 62 [2024-11-11 23:53:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:55,236 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 223 transitions. [2024-11-11 23:53:55,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-11 23:53:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 223 transitions. [2024-11-11 23:53:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 23:53:55,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:55,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:55,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 23:53:55,237 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:55,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash -345367953, now seen corresponding path program 1 times [2024-11-11 23:53:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671607238] [2024-11-11 23:53:55,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:53:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:53:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:53:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671607238] [2024-11-11 23:53:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671607238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:53:55,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:53:55,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:53:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979472541] [2024-11-11 23:53:55,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:53:55,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:53:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:53:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:53:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:55,366 INFO L87 Difference]: Start difference. First operand 174 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11 23:53:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:53:55,383 INFO L93 Difference]: Finished difference Result 306 states and 396 transitions. [2024-11-11 23:53:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:53:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) Word has length 62 [2024-11-11 23:53:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:53:55,384 INFO L225 Difference]: With dead ends: 306 [2024-11-11 23:53:55,384 INFO L226 Difference]: Without dead ends: 178 [2024-11-11 23:53:55,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:53:55,385 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:53:55,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:53:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-11 23:53:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-11 23:53:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 177 states have internal predecessors, (227), 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-11 23:53:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2024-11-11 23:53:55,389 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 227 transitions. Word has length 62 [2024-11-11 23:53:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:53:55,389 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 227 transitions. [2024-11-11 23:53:55,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11 23:53:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2024-11-11 23:53:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 23:53:55,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:53:55,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 23:53:55,390 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:53:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:53:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -673984333, now seen corresponding path program 1 times [2024-11-11 23:53:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:53:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925979121] [2024-11-11 23:53:55,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:53:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:53:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:53:55,469 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 23:53:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:53:55,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 23:53:55,593 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 23:53:55,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 23:53:55,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 23:53:55,597 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:53:55,645 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 23:53:55,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:53:55 BoogieIcfgContainer [2024-11-11 23:53:55,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 23:53:55,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 23:53:55,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 23:53:55,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 23:53:55,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:53:43" (3/4) ... [2024-11-11 23:53:55,653 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 23:53:55,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 23:53:55,654 INFO L158 Benchmark]: Toolchain (without parser) took 13163.17ms. Allocated memory was 167.8MB in the beginning and 631.2MB in the end (delta: 463.5MB). Free memory was 135.6MB in the beginning and 286.8MB in the end (delta: -151.2MB). Peak memory consumption was 311.3MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 119.0MB in the end (delta: 16.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.08ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 111.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: Boogie Preprocessor took 91.56ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 106.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: RCFGBuilder took 674.41ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.1MB in the end (delta: 5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,655 INFO L158 Benchmark]: TraceAbstraction took 12042.86ms. Allocated memory was 167.8MB in the beginning and 631.2MB in the end (delta: 463.5MB). Free memory was 100.1MB in the beginning and 286.8MB in the end (delta: -186.7MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. [2024-11-11 23:53:55,656 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 631.2MB. Free memory is still 286.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:53:55,656 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.17ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 119.0MB in the end (delta: 16.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.08ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 111.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.56ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 106.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 674.41ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.1MB in the end (delta: 5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12042.86ms. Allocated memory was 167.8MB in the beginning and 631.2MB in the end (delta: 463.5MB). Free memory was 100.1MB in the beginning and 286.8MB in the end (delta: -186.7MB). Peak memory consumption was 278.8MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 631.2MB. Free memory is still 286.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 85, overapproximation of bitwiseOr at line 148, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_28 mask_SORT_28 = (SORT_28)-1 >> (sizeof(SORT_28) * 8 - 32); [L33] const SORT_28 msb_SORT_28 = (SORT_28)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_4 var_8 = 0; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_22 = 15; [L39] const SORT_28 var_30 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L44] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L45] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_10_arg_1 = var_8; [L50] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_17_arg_0=1, var_17_arg_1=-256, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) [L69] RET __VERIFIER_assert(!(bad_18_arg_0)) [L71] SORT_1 var_37_arg_0 = input_3; [L72] SORT_1 var_37 = ~var_37_arg_0; [L73] SORT_4 var_38_arg_0 = state_6; [L74] SORT_4 var_38_arg_1 = state_9; [L75] SORT_1 var_38 = var_38_arg_0 > var_38_arg_1; [L76] SORT_1 var_39_arg_0 = var_37; [L77] SORT_1 var_39_arg_1 = var_38; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39_arg_0=-256, var_39_arg_1=1, var_5=1] [L78] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L78] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L79] EXPR var_39 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L79] var_39 = var_39 & mask_SORT_1 [L80] SORT_4 var_29_arg_0 = var_22; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_29_arg_0=15, var_30=1, var_39=0, var_5=1] [L81] EXPR var_29_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L81] var_29_arg_0 = var_29_arg_0 & mask_SORT_4 [L82] SORT_28 var_29 = var_29_arg_0; [L83] SORT_28 var_31_arg_0 = var_29; [L84] SORT_28 var_31_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_31_arg_0=15, var_31_arg_1=1, var_39=0, var_5=1] [L85] EXPR var_31_arg_0 >> var_31_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L85] SORT_28 var_31 = var_31_arg_0 >> var_31_arg_1; [L86] SORT_28 var_32_arg_0 = var_31; [L87] SORT_4 var_32 = var_32_arg_0 >> 0; [L88] SORT_4 var_33_arg_0 = state_6; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_33_arg_0=1, var_39=0, var_5=1] [L89] EXPR var_33_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L89] var_33_arg_0 = var_33_arg_0 & mask_SORT_4 [L90] SORT_28 var_33 = var_33_arg_0; [L91] SORT_28 var_34_arg_0 = var_33; [L92] SORT_28 var_34_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_34_arg_0=0, var_34_arg_1=1, var_39=0, var_5=1] [L93] EXPR var_34_arg_0 >> var_34_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L93] SORT_28 var_34 = var_34_arg_0 >> var_34_arg_1; [L94] SORT_28 var_35_arg_0 = var_34; [L95] SORT_4 var_35 = var_35_arg_0 >> 0; [L96] SORT_4 var_36_arg_0 = var_32; [L97] SORT_4 var_36_arg_1 = var_35; [L98] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L99] SORT_4 var_26_arg_0 = state_6; [L100] SORT_4 var_26_arg_1 = state_9; [L101] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L102] SORT_4 var_21_arg_0 = state_9; [L103] SORT_4 var_21_arg_1 = state_6; [L104] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L105] SORT_4 var_23_arg_0 = state_6; [L106] SORT_4 var_23_arg_1 = var_22; [L107] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L108] SORT_1 var_24_arg_0 = var_21; [L109] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L111] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L111] var_24 = var_24 & mask_SORT_1 [L112] SORT_4 var_20_arg_0 = state_6; [L113] SORT_4 var_20_arg_1 = var_5; [L114] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L115] SORT_1 var_25_arg_0 = var_24; [L116] SORT_4 var_25_arg_1 = var_20; [L117] SORT_4 var_25_arg_2 = state_9; [L118] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L119] SORT_1 var_27_arg_0 = var_26; [L120] SORT_4 var_27_arg_1 = state_6; [L121] SORT_4 var_27_arg_2 = var_25; [L122] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L123] SORT_1 var_40_arg_0 = var_39; [L124] SORT_4 var_40_arg_1 = var_36; [L125] SORT_4 var_40_arg_2 = var_27; [L126] SORT_4 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_40=2, var_5=1] [L127] EXPR var_40 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L127] var_40 = var_40 & mask_SORT_4 [L128] SORT_4 next_41_arg_1 = var_40; [L129] SORT_1 var_48_arg_0 = input_3; [L130] SORT_1 var_48 = ~var_48_arg_0; [L131] SORT_4 var_49_arg_0 = state_6; [L132] SORT_4 var_49_arg_1 = state_9; [L133] SORT_1 var_49 = var_49_arg_0 > var_49_arg_1; [L134] SORT_1 var_50_arg_0 = var_48; [L135] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50_arg_0=-256, var_50_arg_1=1, var_5=1] [L136] EXPR var_50_arg_0 & var_50_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L136] SORT_1 var_50 = var_50_arg_0 & var_50_arg_1; [L137] EXPR var_50 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L137] var_50 = var_50 & mask_SORT_1 [L138] SORT_4 var_43_arg_0 = state_6; [L139] SORT_4 var_43_arg_1 = state_9; [L140] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L141] SORT_1 var_44_arg_0 = var_43; [L142] SORT_1 var_44 = ~var_44_arg_0; [L143] SORT_4 var_45_arg_0 = state_6; [L144] SORT_4 var_45_arg_1 = var_22; [L145] SORT_1 var_45 = var_45_arg_0 != var_45_arg_1; [L146] SORT_1 var_46_arg_0 = var_44; [L147] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_46_arg_0=-2, var_46_arg_1=1, var_50=0, var_5=1] [L148] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L148] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L149] EXPR var_46 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L149] var_46 = var_46 & mask_SORT_1 [L150] SORT_4 var_42_arg_0 = state_9; [L151] SORT_4 var_42_arg_1 = var_5; [L152] SORT_4 var_42 = var_42_arg_0 + var_42_arg_1; [L153] SORT_1 var_47_arg_0 = var_46; [L154] SORT_4 var_47_arg_1 = var_42; [L155] SORT_4 var_47_arg_2 = state_6; [L156] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L157] SORT_1 var_51_arg_0 = var_50; [L158] SORT_4 var_51_arg_1 = state_9; [L159] SORT_4 var_51_arg_2 = var_47; [L160] SORT_4 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_51=1, var_5=1] [L161] EXPR var_51 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_5=1] [L161] var_51 = var_51 & mask_SORT_4 [L162] SORT_4 next_52_arg_1 = var_51; [L164] state_6 = next_41_arg_1 [L165] state_9 = next_52_arg_1 [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2647 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2647 mSDsluCounter, 9940 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7616 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2807 IncrementalHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2324 mSDtfsCounter, 2807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=18, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 460 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1246 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 5639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 120/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 23:53:55,680 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:53:57,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:53:57,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-11 23:53:57,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:53:57,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:53:57,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:53:57,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:53:57,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:53:57,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:53:57,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:53:57,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:53:57,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:53:57,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:53:57,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:53:57,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:53:57,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:53:57,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:53:57,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:53:57,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:53:57,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:53:57,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:53:57,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:53:57,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:53:57,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:53:57,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:53:57,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:53:57,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:53:57,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:53:57,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:53:57,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:53:57,605 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 23:53:57,605 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 23:53:57,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:53:57,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:53:57,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:53:57,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:53:57,606 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2024-11-11 23:53:57,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:53:57,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:53:57,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:53:57,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:53:57,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:53:57,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-11 23:53:59,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:53:59,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:53:59,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-11 23:53:59,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d60fa18/83d26709e2a0480eb30e2f24c6dd80e8/FLAG5d157e8a2 [2024-11-11 23:53:59,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d60fa18/83d26709e2a0480eb30e2f24c6dd80e8 [2024-11-11 23:53:59,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:53:59,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:53:59,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:53:59,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:53:59,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:53:59,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:53:59" (1/1) ... [2024-11-11 23:53:59,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a24eacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:53:59, skipping insertion in model container [2024-11-11 23:53:59,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:53:59" (1/1) ... [2024-11-11 23:53:59,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:53:59,953 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-11 23:54:00,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:54:00,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:54:00,027 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-11 23:54:00,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:54:00,077 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:54:00,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00 WrapperNode [2024-11-11 23:54:00,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:54:00,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:54:00,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:54:00,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:54:00,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,116 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-11-11 23:54:00,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:54:00,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:54:00,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:54:00,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:54:00,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,152 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-11 23:54:00,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:54:00,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:54:00,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:54:00,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:54:00,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (1/1) ... [2024-11-11 23:54:00,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:54:00,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:54:00,221 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-11 23:54:00,223 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-11 23:54:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:54:00,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 23:54:00,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:54:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:54:00,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:54:00,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:54:00,567 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-11 23:54:00,568 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:54:00,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:54:00,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:54:00,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:54:00 BoogieIcfgContainer [2024-11-11 23:54:00,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:54:00,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:54:00,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:54:00,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:54:00,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:53:59" (1/3) ... [2024-11-11 23:54:00,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9cef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:54:00, skipping insertion in model container [2024-11-11 23:54:00,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:54:00" (2/3) ... [2024-11-11 23:54:00,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9cef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:54:00, skipping insertion in model container [2024-11-11 23:54:00,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:54:00" (3/3) ... [2024-11-11 23:54:00,591 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2024-11-11 23:54:00,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:54:00,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:54:00,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:54:00,661 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;@5de0506b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:54:00,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:54:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-11 23:54:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-11 23:54:00,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:54:00,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-11 23:54:00,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:54:00,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:54:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-11 23:54:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:54:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758386586] [2024-11-11 23:54:00,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:54:00,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:54:00,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:54:00,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 23:54:00,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 23:54:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:54:00,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 23:54:00,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:54:00,953 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-11 23:54:00,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 23:54:00,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:54:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758386586] [2024-11-11 23:54:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758386586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:54:00,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:54:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:54:00,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586367856] [2024-11-11 23:54:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:54:00,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:54:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:54:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:54:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:54:00,986 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11 23:54:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:54:01,049 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-11 23:54:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:54:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2024-11-11 23:54:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:54:01,060 INFO L225 Difference]: With dead ends: 18 [2024-11-11 23:54:01,060 INFO L226 Difference]: Without dead ends: 10 [2024-11-11 23:54:01,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:54:01,067 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:54:01,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:54:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-11 23:54:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-11 23:54:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11 23:54:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-11 23:54:01,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-11 23:54:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:54:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-11 23:54:01,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11 23:54:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-11 23:54:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 23:54:01,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:54:01,091 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-11 23:54:01,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-11 23:54:01,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:54:01,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:54:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:54:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-11 23:54:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:54:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023758539] [2024-11-11 23:54:01,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:54:01,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:54:01,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:54:01,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 23:54:01,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 23:54:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:54:01,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 23:54:01,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:54:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:54:01,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:54:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:54:05,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:54:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023758539] [2024-11-11 23:54:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023758539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 23:54:05,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:54:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 23:54:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910527138] [2024-11-11 23:54:05,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 23:54:05,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:54:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:54:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:54:05,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:54:05,164 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-11 23:54:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:54:05,468 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-11 23:54:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 23:54:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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) Word has length 8 [2024-11-11 23:54:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:54:05,469 INFO L225 Difference]: With dead ends: 18 [2024-11-11 23:54:05,469 INFO L226 Difference]: Without dead ends: 16 [2024-11-11 23:54:05,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-11 23:54:05,471 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:54:05,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:54:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-11 23:54:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-11 23:54:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-11 23:54:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-11 23:54:05,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-11 23:54:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:54:05,476 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-11 23:54:05,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-11 23:54:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-11 23:54:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 23:54:05,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:54:05,477 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-11 23:54:05,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 23:54:05,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:54:05,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:54:05,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:54:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-11 23:54:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:54:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517294876] [2024-11-11 23:54:05,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 23:54:05,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:54:05,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:54:05,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 23:54:05,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 23:54:05,777 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 23:54:05,777 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 23:54:05,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 23:54:05,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:54:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:54:07,178 INFO L312 TraceCheckSpWp]: Computing backward predicates...