./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 09:39:03,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 09:39:03,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 09:39:03,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 09:39:03,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 09:39:03,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 09:39:03,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 09:39:03,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 09:39:03,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 09:39:03,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 09:39:03,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 09:39:03,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 09:39:03,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 09:39:03,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 09:39:03,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 09:39:03,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 09:39:03,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 09:39:03,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 09:39:03,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 09:39:03,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 09:39:03,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 09:39:03,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 09:39:03,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 09:39:03,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 09:39:03,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 09:39:03,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 09:39:03,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 09:39:03,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 09:39:03,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 09:39:03,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 09:39:03,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 09:39:03,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 09:39:03,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:39:03,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 09:39:03,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 09:39:03,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 09:39:03,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 09:39:03,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 09:39:03,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 09:39:03,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 09:39:03,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 09:39:03,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 09:39:03,558 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 [2024-11-22 09:39:03,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 09:39:03,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 09:39:03,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 09:39:03,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 09:39:03,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 09:39:03,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2024-11-22 09:39:05,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 09:39:05,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 09:39:05,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2024-11-22 09:39:05,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00db2e91d/cf44d505361344e8b62d51a49304e056/FLAG20fc7623a [2024-11-22 09:39:05,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00db2e91d/cf44d505361344e8b62d51a49304e056 [2024-11-22 09:39:05,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 09:39:05,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 09:39:05,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 09:39:05,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 09:39:05,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 09:39:05,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f4071f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05, skipping insertion in model container [2024-11-22 09:39:05,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 09:39:05,669 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i[919,932] [2024-11-22 09:39:05,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:39:05,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 09:39:05,809 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i[919,932] [2024-11-22 09:39:05,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:39:05,880 INFO L204 MainTranslator]: Completed translation [2024-11-22 09:39:05,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05 WrapperNode [2024-11-22 09:39:05,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 09:39:05,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 09:39:05,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 09:39:05,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 09:39:05,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,954 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 302 [2024-11-22 09:39:05,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 09:39:05,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 09:39:05,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 09:39:05,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 09:39:05,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:05,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,010 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-22 09:39:06,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 09:39:06,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 09:39:06,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 09:39:06,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 09:39:06,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (1/1) ... [2024-11-22 09:39:06,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:39:06,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:39:06,102 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-22 09:39:06,107 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-22 09:39:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 09:39:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 09:39:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 09:39:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 09:39:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 09:39:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 09:39:06,295 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 09:39:06,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 09:39:06,840 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-22 09:39:06,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 09:39:06,857 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 09:39:06,857 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 09:39:06,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:39:06 BoogieIcfgContainer [2024-11-22 09:39:06,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 09:39:06,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 09:39:06,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 09:39:06,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 09:39:06,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:39:05" (1/3) ... [2024-11-22 09:39:06,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd8acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:39:06, skipping insertion in model container [2024-11-22 09:39:06,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:39:05" (2/3) ... [2024-11-22 09:39:06,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd8acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:39:06, skipping insertion in model container [2024-11-22 09:39:06,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:39:06" (3/3) ... [2024-11-22 09:39:06,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2024-11-22 09:39:06,884 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 09:39:06,884 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 09:39:06,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 09:39:06,956 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;@42084478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 09:39:06,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 09:39:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 09:39:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-22 09:39:06,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:06,981 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:06,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -741077870, now seen corresponding path program 1 times [2024-11-22 09:39:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850157455] [2024-11-22 09:39:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2024-11-22 09:39:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850157455] [2024-11-22 09:39:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850157455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:39:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350096911] [2024-11-22 09:39:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:07,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:39:07,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:39:07,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:39:07,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 09:39:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:07,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 09:39:07,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:39:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2024-11-22 09:39:07,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:39:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350096911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:07,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:39:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 09:39:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203791347] [2024-11-22 09:39:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:07,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 09:39:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 09:39:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:39:07,929 INFO L87 Difference]: Start difference. First operand has 131 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:07,977 INFO L93 Difference]: Finished difference Result 255 states and 462 transitions. [2024-11-22 09:39:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 09:39:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2024-11-22 09:39:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:07,993 INFO L225 Difference]: With dead ends: 255 [2024-11-22 09:39:07,994 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 09:39:07,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:39:08,001 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:08,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:39:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 09:39:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-22 09:39:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 09:39:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2024-11-22 09:39:08,066 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2024-11-22 09:39:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2024-11-22 09:39:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2024-11-22 09:39:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-22 09:39:08,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:08,075 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:08,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 09:39:08,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 09:39:08,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1251433866, now seen corresponding path program 1 times [2024-11-22 09:39:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672491011] [2024-11-22 09:39:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672491011] [2024-11-22 09:39:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672491011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:39:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342252677] [2024-11-22 09:39:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:39:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:39:08,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:39:08,703 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:08,787 INFO L93 Difference]: Finished difference Result 358 states and 579 transitions. [2024-11-22 09:39:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:39:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2024-11-22 09:39:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:08,797 INFO L225 Difference]: With dead ends: 358 [2024-11-22 09:39:08,798 INFO L226 Difference]: Without dead ends: 234 [2024-11-22 09:39:08,799 INFO L431 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-22 09:39:08,800 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 92 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:08,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:39:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-22 09:39:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 219. [2024-11-22 09:39:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-22 09:39:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 351 transitions. [2024-11-22 09:39:08,853 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 351 transitions. Word has length 295 [2024-11-22 09:39:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:08,856 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 351 transitions. [2024-11-22 09:39:08,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2024-11-22 09:39:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-22 09:39:08,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:08,863 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 09:39:08,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:08,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash -729029896, now seen corresponding path program 1 times [2024-11-22 09:39:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721880199] [2024-11-22 09:39:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:09,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:09,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721880199] [2024-11-22 09:39:09,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721880199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:09,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:09,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 09:39:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555979562] [2024-11-22 09:39:09,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 09:39:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 09:39:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 09:39:09,615 INFO L87 Difference]: Start difference. First operand 219 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:09,891 INFO L93 Difference]: Finished difference Result 357 states and 575 transitions. [2024-11-22 09:39:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 09:39:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2024-11-22 09:39:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:09,895 INFO L225 Difference]: With dead ends: 357 [2024-11-22 09:39:09,895 INFO L226 Difference]: Without dead ends: 230 [2024-11-22 09:39:09,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 09:39:09,897 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 85 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:09,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 484 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 09:39:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-22 09:39:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 220. [2024-11-22 09:39:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 121 states have (on average 1.322314049586777) internal successors, (160), 121 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-22 09:39:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2024-11-22 09:39:09,938 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 296 [2024-11-22 09:39:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:09,939 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2024-11-22 09:39:09,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2024-11-22 09:39:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-22 09:39:09,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:09,944 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:09,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 09:39:09,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:09,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1144945132, now seen corresponding path program 1 times [2024-11-22 09:39:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017822767] [2024-11-22 09:39:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017822767] [2024-11-22 09:39:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017822767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 09:39:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257753511] [2024-11-22 09:39:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:11,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 09:39:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:11,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 09:39:11,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 09:39:11,325 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:12,079 INFO L93 Difference]: Finished difference Result 377 states and 603 transitions. [2024-11-22 09:39:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 09:39:12,080 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), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2024-11-22 09:39:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:12,083 INFO L225 Difference]: With dead ends: 377 [2024-11-22 09:39:12,083 INFO L226 Difference]: Without dead ends: 253 [2024-11-22 09:39:12,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-22 09:39:12,085 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 204 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:12,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 730 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 09:39:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-22 09:39:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 232. [2024-11-22 09:39:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 133 states have internal predecessors, (180), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-22 09:39:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 372 transitions. [2024-11-22 09:39:12,157 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 372 transitions. Word has length 297 [2024-11-22 09:39:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:12,158 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 372 transitions. [2024-11-22 09:39:12,158 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), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 372 transitions. [2024-11-22 09:39:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-22 09:39:12,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:12,163 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 09:39:12,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 886779694, now seen corresponding path program 1 times [2024-11-22 09:39:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366492467] [2024-11-22 09:39:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366492467] [2024-11-22 09:39:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366492467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 09:39:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970551721] [2024-11-22 09:39:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:13,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 09:39:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 09:39:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 09:39:13,069 INFO L87 Difference]: Start difference. First operand 232 states and 372 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:13,665 INFO L93 Difference]: Finished difference Result 378 states and 609 transitions. [2024-11-22 09:39:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 09:39:13,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 297 [2024-11-22 09:39:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:13,673 INFO L225 Difference]: With dead ends: 378 [2024-11-22 09:39:13,673 INFO L226 Difference]: Without dead ends: 244 [2024-11-22 09:39:13,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 09:39:13,675 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 186 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:13,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 510 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 09:39:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-22 09:39:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2024-11-22 09:39:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 137 states have internal predecessors, (186), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-22 09:39:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 378 transitions. [2024-11-22 09:39:13,754 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 378 transitions. Word has length 297 [2024-11-22 09:39:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:13,758 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 378 transitions. [2024-11-22 09:39:13,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 378 transitions. [2024-11-22 09:39:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-22 09:39:13,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:13,764 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:13,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 09:39:13,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:13,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1414042896, now seen corresponding path program 1 times [2024-11-22 09:39:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:13,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498990195] [2024-11-22 09:39:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498990195] [2024-11-22 09:39:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498990195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:24,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 09:39:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339480573] [2024-11-22 09:39:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 09:39:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 09:39:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 09:39:24,540 INFO L87 Difference]: Start difference. First operand 236 states and 378 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:26,882 INFO L93 Difference]: Finished difference Result 467 states and 728 transitions. [2024-11-22 09:39:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 09:39:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2024-11-22 09:39:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:26,886 INFO L225 Difference]: With dead ends: 467 [2024-11-22 09:39:26,886 INFO L226 Difference]: Without dead ends: 343 [2024-11-22 09:39:26,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-22 09:39:26,888 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 676 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:26,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 963 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 09:39:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-22 09:39:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 249. [2024-11-22 09:39:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-22 09:39:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 397 transitions. [2024-11-22 09:39:26,930 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 397 transitions. Word has length 297 [2024-11-22 09:39:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 397 transitions. [2024-11-22 09:39:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2024-11-22 09:39:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-22 09:39:26,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:26,935 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:26,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 09:39:26,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1807069906, now seen corresponding path program 1 times [2024-11-22 09:39:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:26,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845399895] [2024-11-22 09:39:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:26,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845399895] [2024-11-22 09:39:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845399895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 09:39:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013169315] [2024-11-22 09:39:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 09:39:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 09:39:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 09:39:27,254 INFO L87 Difference]: Start difference. First operand 249 states and 397 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:27,333 INFO L93 Difference]: Finished difference Result 410 states and 648 transitions. [2024-11-22 09:39:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 09:39:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2024-11-22 09:39:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:27,336 INFO L225 Difference]: With dead ends: 410 [2024-11-22 09:39:27,337 INFO L226 Difference]: Without dead ends: 286 [2024-11-22 09:39:27,337 INFO L431 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-22 09:39:27,338 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 42 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:27,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 599 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 09:39:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-22 09:39:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2024-11-22 09:39:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 179 states have (on average 1.3575418994413408) internal successors, (243), 180 states have internal predecessors, (243), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:39:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 443 transitions. [2024-11-22 09:39:27,378 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 443 transitions. Word has length 297 [2024-11-22 09:39:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 443 transitions. [2024-11-22 09:39:27,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 443 transitions. [2024-11-22 09:39:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-22 09:39:27,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:27,380 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 09:39:27,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -712978318, now seen corresponding path program 1 times [2024-11-22 09:39:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876186290] [2024-11-22 09:39:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876186290] [2024-11-22 09:39:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876186290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 09:39:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802489311] [2024-11-22 09:39:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:37,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 09:39:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 09:39:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-22 09:39:37,071 INFO L87 Difference]: Start difference. First operand 283 states and 443 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:37,815 INFO L93 Difference]: Finished difference Result 479 states and 741 transitions. [2024-11-22 09:39:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 09:39:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2024-11-22 09:39:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:37,821 INFO L225 Difference]: With dead ends: 479 [2024-11-22 09:39:37,822 INFO L226 Difference]: Without dead ends: 323 [2024-11-22 09:39:37,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-22 09:39:37,823 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 157 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 690 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 09:39:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-22 09:39:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 281. [2024-11-22 09:39:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 178 states have internal predecessors, (241), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:39:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 441 transitions. [2024-11-22 09:39:37,861 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 441 transitions. Word has length 297 [2024-11-22 09:39:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 441 transitions. [2024-11-22 09:39:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:39:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 441 transitions. [2024-11-22 09:39:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-22 09:39:37,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:37,864 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:37,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 09:39:37,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:37,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 222382064, now seen corresponding path program 1 times [2024-11-22 09:39:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212542975] [2024-11-22 09:39:37,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212542975] [2024-11-22 09:39:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212542975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 09:39:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489935817] [2024-11-22 09:39:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 09:39:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 09:39:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-22 09:39:44,251 INFO L87 Difference]: Start difference. First operand 281 states and 441 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:45,901 INFO L93 Difference]: Finished difference Result 647 states and 978 transitions. [2024-11-22 09:39:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 09:39:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 298 [2024-11-22 09:39:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:45,907 INFO L225 Difference]: With dead ends: 647 [2024-11-22 09:39:45,908 INFO L226 Difference]: Without dead ends: 481 [2024-11-22 09:39:45,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-11-22 09:39:45,911 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 751 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:45,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1171 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 09:39:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-22 09:39:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 286. [2024-11-22 09:39:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 183 states have internal predecessors, (249), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:39:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 449 transitions. [2024-11-22 09:39:45,954 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 449 transitions. Word has length 298 [2024-11-22 09:39:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:45,954 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 449 transitions. [2024-11-22 09:39:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 449 transitions. [2024-11-22 09:39:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-22 09:39:45,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:45,957 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 09:39:45,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:45,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash -170644946, now seen corresponding path program 1 times [2024-11-22 09:39:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758469432] [2024-11-22 09:39:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:39:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:39:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:39:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758469432] [2024-11-22 09:39:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758469432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:39:54,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:39:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 09:39:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476666773] [2024-11-22 09:39:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:39:54,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 09:39:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:39:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 09:39:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 09:39:54,432 INFO L87 Difference]: Start difference. First operand 286 states and 449 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:39:56,365 INFO L93 Difference]: Finished difference Result 615 states and 934 transitions. [2024-11-22 09:39:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 09:39:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 298 [2024-11-22 09:39:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:39:56,369 INFO L225 Difference]: With dead ends: 615 [2024-11-22 09:39:56,369 INFO L226 Difference]: Without dead ends: 449 [2024-11-22 09:39:56,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-11-22 09:39:56,370 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 612 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 09:39:56,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1022 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 09:39:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-22 09:39:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 294. [2024-11-22 09:39:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 190 states have (on average 1.368421052631579) internal successors, (260), 191 states have internal predecessors, (260), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:39:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 460 transitions. [2024-11-22 09:39:56,416 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 460 transitions. Word has length 298 [2024-11-22 09:39:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:39:56,416 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 460 transitions. [2024-11-22 09:39:56,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:39:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 460 transitions. [2024-11-22 09:39:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-22 09:39:56,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:39:56,419 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:39:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 09:39:56,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:39:56,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:39:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash 923446642, now seen corresponding path program 1 times [2024-11-22 09:39:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:39:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336627534] [2024-11-22 09:39:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:39:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:39:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:40:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:40:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:40:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336627534] [2024-11-22 09:40:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336627534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:40:02,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:40:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 09:40:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492349058] [2024-11-22 09:40:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:40:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 09:40:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:40:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 09:40:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-22 09:40:02,054 INFO L87 Difference]: Start difference. First operand 294 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:40:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:40:06,439 INFO L93 Difference]: Finished difference Result 640 states and 964 transitions. [2024-11-22 09:40:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 09:40:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2024-11-22 09:40:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:40:06,445 INFO L225 Difference]: With dead ends: 640 [2024-11-22 09:40:06,445 INFO L226 Difference]: Without dead ends: 474 [2024-11-22 09:40:06,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-22 09:40:06,447 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 456 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 09:40:06,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1049 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 09:40:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-22 09:40:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 295. [2024-11-22 09:40:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 191 states have (on average 1.3717277486910995) internal successors, (262), 192 states have internal predecessors, (262), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:40:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 462 transitions. [2024-11-22 09:40:06,491 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 462 transitions. Word has length 298 [2024-11-22 09:40:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:40:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 462 transitions. [2024-11-22 09:40:06,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-22 09:40:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 462 transitions. [2024-11-22 09:40:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-22 09:40:06,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:40:06,494 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:40:06,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 09:40:06,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:40:06,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:40:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash 530419632, now seen corresponding path program 1 times [2024-11-22 09:40:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:40:06,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9779483] [2024-11-22 09:40:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:40:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:40:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:40:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:40:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:40:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9779483] [2024-11-22 09:40:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9779483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:40:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:40:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 09:40:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852225247] [2024-11-22 09:40:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:40:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 09:40:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:40:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 09:40:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-22 09:40:12,603 INFO L87 Difference]: Start difference. First operand 295 states and 462 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:40:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:40:14,186 INFO L93 Difference]: Finished difference Result 587 states and 895 transitions. [2024-11-22 09:40:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 09:40:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 298 [2024-11-22 09:40:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:40:14,191 INFO L225 Difference]: With dead ends: 587 [2024-11-22 09:40:14,191 INFO L226 Difference]: Without dead ends: 421 [2024-11-22 09:40:14,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-22 09:40:14,193 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 370 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 09:40:14,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1196 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 09:40:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-22 09:40:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 294. [2024-11-22 09:40:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 190 states have (on average 1.368421052631579) internal successors, (260), 191 states have internal predecessors, (260), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 09:40:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 460 transitions. [2024-11-22 09:40:14,235 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 460 transitions. Word has length 298 [2024-11-22 09:40:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:40:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 460 transitions. [2024-11-22 09:40:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-22 09:40:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 460 transitions. [2024-11-22 09:40:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-22 09:40:14,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:40:14,238 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:40:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 09:40:14,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:40:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:40:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -788735186, now seen corresponding path program 1 times [2024-11-22 09:40:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:40:14,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541723394] [2024-11-22 09:40:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:40:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:40:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:40:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-22 09:40:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:40:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541723394] [2024-11-22 09:40:20,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541723394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:40:20,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:40:20,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 09:40:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782751809] [2024-11-22 09:40:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:40:20,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 09:40:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:40:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 09:40:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 09:40:20,571 INFO L87 Difference]: Start difference. First operand 294 states and 460 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48)