./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:31:27,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:31:27,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:31:27,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:31:27,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:31:28,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:31:28,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:31:28,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:31:28,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:31:28,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:31:28,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:31:28,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:31:28,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:31:28,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:31:28,030 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:31:28,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:31:28,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:31:28,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:31:28,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:31:28,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:31:28,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:31:28,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:31:28,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:31:28,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:31:28,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:31:28,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:31:28,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:31:28,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:31:28,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:31:28,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:31:28,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:31:28,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:31:28,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:31:28,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:31:28,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:31:28,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:31:28,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:31:28,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:31:28,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:31:28,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:31:28,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:31:28,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:31:28,040 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-10-13 00:31:28,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:31:28,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:31:28,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:31:28,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:31:28,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:31:28,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:30,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:31:30,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:31:30,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:30,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c407f68/eb0ade8746e94367b1e96e373ecb542c/FLAGdc89200ff [2024-10-13 00:31:30,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c407f68/eb0ade8746e94367b1e96e373ecb542c [2024-10-13 00:31:30,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:31:30,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:31:30,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:31:30,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:31:30,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:31:30,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:30" (1/1) ... [2024-10-13 00:31:30,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698f4ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:30, skipping insertion in model container [2024-10-13 00:31:30,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:30" (1/1) ... [2024-10-13 00:31:30,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:31:31,026 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-13 00:31:31,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:31:31,162 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:31:31,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-13 00:31:31,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:31:31,271 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:31:31,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31 WrapperNode [2024-10-13 00:31:31,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:31:31,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:31:31,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:31:31,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:31:31,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,361 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-10-13 00:31:31,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:31:31,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:31:31,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:31:31,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:31:31,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:31:31,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:31:31,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:31:31,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:31:31,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:31:31,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (1/1) ... [2024-10-13 00:31:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:31:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:31:31,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:31:31,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:31:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:31:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:31:31,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:31:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:31:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:31:31,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:31:31,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:31:31,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:31:32,362 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 00:31:32,363 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:31:32,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:31:32,423 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:31:32,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:32 BoogieIcfgContainer [2024-10-13 00:31:32,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:31:32,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:31:32,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:31:32,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:31:32,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:31:30" (1/3) ... [2024-10-13 00:31:32,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f700827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:32, skipping insertion in model container [2024-10-13 00:31:32,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:31" (2/3) ... [2024-10-13 00:31:32,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f700827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:32, skipping insertion in model container [2024-10-13 00:31:32,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:32" (3/3) ... [2024-10-13 00:31:32,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:32,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:31:32,454 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:31:32,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:31:32,531 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;@1a6a1cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:31:32,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:31:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 85 states have (on average 1.576470588235294) internal successors, (134), 86 states have internal predecessors, (134), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-13 00:31:32,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:32,569 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:32,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:32,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1103932151, now seen corresponding path program 1 times [2024-10-13 00:31:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951806848] [2024-10-13 00:31:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:33,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951806848] [2024-10-13 00:31:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951806848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:33,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:31:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395871275] [2024-10-13 00:31:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:33,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:31:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:31:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:31:33,708 INFO L87 Difference]: Start difference. First operand has 127 states, 85 states have (on average 1.576470588235294) internal successors, (134), 86 states have internal predecessors, (134), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:33,834 INFO L93 Difference]: Finished difference Result 317 states and 607 transitions. [2024-10-13 00:31:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:31:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-10-13 00:31:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:33,853 INFO L225 Difference]: With dead ends: 317 [2024-10-13 00:31:33,854 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 00:31:33,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 00:31:33,867 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 198 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:33,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:31:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 00:31:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2024-10-13 00:31:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.5) internal successors, (126), 84 states have internal predecessors, (126), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 204 transitions. [2024-10-13 00:31:33,948 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 204 transitions. Word has length 246 [2024-10-13 00:31:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:33,951 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 204 transitions. [2024-10-13 00:31:33,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2024-10-13 00:31:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-13 00:31:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:33,958 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:33,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:31:33,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:33,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1796965249, now seen corresponding path program 1 times [2024-10-13 00:31:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856060701] [2024-10-13 00:31:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:34,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856060701] [2024-10-13 00:31:34,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856060701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:34,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:34,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:31:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330214994] [2024-10-13 00:31:34,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:34,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:31:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:34,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:31:34,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:34,545 INFO L87 Difference]: Start difference. First operand 125 states and 204 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:34,885 INFO L93 Difference]: Finished difference Result 343 states and 559 transitions. [2024-10-13 00:31:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:31:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 247 [2024-10-13 00:31:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:34,891 INFO L225 Difference]: With dead ends: 343 [2024-10-13 00:31:34,891 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 00:31:34,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:34,893 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 318 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:34,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 583 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:31:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 00:31:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 145. [2024-10-13 00:31:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 234 transitions. [2024-10-13 00:31:34,914 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 234 transitions. Word has length 247 [2024-10-13 00:31:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 234 transitions. [2024-10-13 00:31:34,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 234 transitions. [2024-10-13 00:31:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:34,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:34,918 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:34,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:31:34,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:34,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 946612612, now seen corresponding path program 1 times [2024-10-13 00:31:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:34,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040717939] [2024-10-13 00:31:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:35,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040717939] [2024-10-13 00:31:35,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040717939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:35,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:31:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508790939] [2024-10-13 00:31:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:31:35,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:31:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:31:35,217 INFO L87 Difference]: Start difference. First operand 145 states and 234 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:35,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:35,249 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2024-10-13 00:31:35,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:31:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:35,252 INFO L225 Difference]: With dead ends: 290 [2024-10-13 00:31:35,252 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 00:31:35,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 00:31:35,254 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:35,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:31:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 00:31:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-13 00:31:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 104 states have internal predecessors, (157), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 235 transitions. [2024-10-13 00:31:35,269 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 235 transitions. Word has length 248 [2024-10-13 00:31:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:35,270 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 235 transitions. [2024-10-13 00:31:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 235 transitions. [2024-10-13 00:31:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:35,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:35,273 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:35,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:31:35,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:35,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -641735290, now seen corresponding path program 1 times [2024-10-13 00:31:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161939811] [2024-10-13 00:31:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161939811] [2024-10-13 00:31:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161939811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:31:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60122717] [2024-10-13 00:31:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:35,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:31:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:31:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:31:35,501 INFO L87 Difference]: Start difference. First operand 146 states and 235 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:35,570 INFO L93 Difference]: Finished difference Result 400 states and 643 transitions. [2024-10-13 00:31:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:31:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:35,573 INFO L225 Difference]: With dead ends: 400 [2024-10-13 00:31:35,574 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 00:31:35,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-13 00:31:35,575 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 136 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:35,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 483 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:31:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 00:31:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-10-13 00:31:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.5161290322580645) internal successors, (282), 187 states have internal predecessors, (282), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 00:31:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 404 transitions. [2024-10-13 00:31:35,598 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 404 transitions. Word has length 248 [2024-10-13 00:31:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:35,599 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 404 transitions. [2024-10-13 00:31:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 404 transitions. [2024-10-13 00:31:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:35,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:35,603 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:35,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:31:35,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash -579695676, now seen corresponding path program 1 times [2024-10-13 00:31:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919919011] [2024-10-13 00:31:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919919011] [2024-10-13 00:31:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919919011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:35,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:31:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010313546] [2024-10-13 00:31:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:35,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:31:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:31:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:31:35,982 INFO L87 Difference]: Start difference. First operand 252 states and 404 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:36,277 INFO L93 Difference]: Finished difference Result 657 states and 1057 transitions. [2024-10-13 00:31:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:31:36,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:36,283 INFO L225 Difference]: With dead ends: 657 [2024-10-13 00:31:36,283 INFO L226 Difference]: Without dead ends: 406 [2024-10-13 00:31:36,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:31:36,285 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 285 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:36,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 671 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:31:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-13 00:31:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 254. [2024-10-13 00:31:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.5212765957446808) internal successors, (286), 189 states have internal predecessors, (286), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 00:31:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 408 transitions. [2024-10-13 00:31:36,321 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 408 transitions. Word has length 248 [2024-10-13 00:31:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:36,321 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 408 transitions. [2024-10-13 00:31:36,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 408 transitions. [2024-10-13 00:31:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:36,325 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:31:36,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -360840958, now seen corresponding path program 1 times [2024-10-13 00:31:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858862323] [2024-10-13 00:31:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:36,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:36,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858862323] [2024-10-13 00:31:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858862323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:36,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:31:36,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298396922] [2024-10-13 00:31:36,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:36,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:31:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:31:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:31:36,957 INFO L87 Difference]: Start difference. First operand 254 states and 408 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:37,639 INFO L93 Difference]: Finished difference Result 944 states and 1504 transitions. [2024-10-13 00:31:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:31:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:37,647 INFO L225 Difference]: With dead ends: 944 [2024-10-13 00:31:37,648 INFO L226 Difference]: Without dead ends: 691 [2024-10-13 00:31:37,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:31:37,651 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 413 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:37,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1118 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:31:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-13 00:31:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 254. [2024-10-13 00:31:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.5106382978723405) internal successors, (284), 189 states have internal predecessors, (284), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 00:31:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 406 transitions. [2024-10-13 00:31:37,698 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 406 transitions. Word has length 248 [2024-10-13 00:31:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 406 transitions. [2024-10-13 00:31:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 406 transitions. [2024-10-13 00:31:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:37,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:37,708 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:37,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 00:31:37,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2008600770, now seen corresponding path program 1 times [2024-10-13 00:31:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793235489] [2024-10-13 00:31:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793235489] [2024-10-13 00:31:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793235489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:38,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 00:31:38,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017715409] [2024-10-13 00:31:38,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:38,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 00:31:38,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 00:31:38,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:31:38,121 INFO L87 Difference]: Start difference. First operand 254 states and 406 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:39,245 INFO L93 Difference]: Finished difference Result 948 states and 1505 transitions. [2024-10-13 00:31:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 00:31:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:39,251 INFO L225 Difference]: With dead ends: 948 [2024-10-13 00:31:39,252 INFO L226 Difference]: Without dead ends: 695 [2024-10-13 00:31:39,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:31:39,254 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 677 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:39,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1047 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:31:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-13 00:31:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 474. [2024-10-13 00:31:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 343 states have (on average 1.4839650145772594) internal successors, (509), 345 states have internal predecessors, (509), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-13 00:31:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 753 transitions. [2024-10-13 00:31:39,328 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 753 transitions. Word has length 248 [2024-10-13 00:31:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:39,329 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 753 transitions. [2024-10-13 00:31:39,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 753 transitions. [2024-10-13 00:31:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:39,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:39,333 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:39,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 00:31:39,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 597422784, now seen corresponding path program 1 times [2024-10-13 00:31:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082651545] [2024-10-13 00:31:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082651545] [2024-10-13 00:31:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082651545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:31:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210104063] [2024-10-13 00:31:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:31:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:31:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:40,102 INFO L87 Difference]: Start difference. First operand 474 states and 753 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:40,208 INFO L93 Difference]: Finished difference Result 981 states and 1554 transitions. [2024-10-13 00:31:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:31:40,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:40,213 INFO L225 Difference]: With dead ends: 981 [2024-10-13 00:31:40,214 INFO L226 Difference]: Without dead ends: 508 [2024-10-13 00:31:40,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:40,218 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 26 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:40,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 575 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:31:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-13 00:31:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 490. [2024-10-13 00:31:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 359 states have (on average 1.4846796657381616) internal successors, (533), 361 states have internal predecessors, (533), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-13 00:31:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 777 transitions. [2024-10-13 00:31:40,305 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 777 transitions. Word has length 248 [2024-10-13 00:31:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:40,306 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 777 transitions. [2024-10-13 00:31:40,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 777 transitions. [2024-10-13 00:31:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 00:31:40,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:40,311 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:40,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 00:31:40,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:40,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash 597482366, now seen corresponding path program 1 times [2024-10-13 00:31:40,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:40,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519857996] [2024-10-13 00:31:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:40,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:40,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519857996] [2024-10-13 00:31:40,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519857996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:40,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:40,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:31:40,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595986619] [2024-10-13 00:31:40,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:31:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:31:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:40,919 INFO L87 Difference]: Start difference. First operand 490 states and 777 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:41,255 INFO L93 Difference]: Finished difference Result 1305 states and 2076 transitions. [2024-10-13 00:31:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:31:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-10-13 00:31:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:41,262 INFO L225 Difference]: With dead ends: 1305 [2024-10-13 00:31:41,262 INFO L226 Difference]: Without dead ends: 816 [2024-10-13 00:31:41,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:31:41,267 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 186 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:41,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 711 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:31:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-13 00:31:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 738. [2024-10-13 00:31:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 566 states have (on average 1.5070671378091873) internal successors, (853), 568 states have internal predecessors, (853), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1175 transitions. [2024-10-13 00:31:41,357 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1175 transitions. Word has length 248 [2024-10-13 00:31:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:41,357 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1175 transitions. [2024-10-13 00:31:41,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1175 transitions. [2024-10-13 00:31:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-13 00:31:41,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:41,363 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:41,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 00:31:41,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:41,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1661596282, now seen corresponding path program 1 times [2024-10-13 00:31:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763646291] [2024-10-13 00:31:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:43,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763646291] [2024-10-13 00:31:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763646291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:43,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 00:31:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812604770] [2024-10-13 00:31:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 00:31:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 00:31:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:31:43,026 INFO L87 Difference]: Start difference. First operand 738 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 00:31:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:44,758 INFO L93 Difference]: Finished difference Result 2488 states and 3964 transitions. [2024-10-13 00:31:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:31:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 249 [2024-10-13 00:31:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:44,774 INFO L225 Difference]: With dead ends: 2488 [2024-10-13 00:31:44,775 INFO L226 Difference]: Without dead ends: 1957 [2024-10-13 00:31:44,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-13 00:31:44,780 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1107 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:44,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 742 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 00:31:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2024-10-13 00:31:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 784. [2024-10-13 00:31:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 612 states have (on average 1.4983660130718954) internal successors, (917), 614 states have internal predecessors, (917), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1239 transitions. [2024-10-13 00:31:44,952 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1239 transitions. Word has length 249 [2024-10-13 00:31:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:44,953 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1239 transitions. [2024-10-13 00:31:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 00:31:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1239 transitions. [2024-10-13 00:31:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-13 00:31:44,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:44,957 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 00:31:44,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1527582776, now seen corresponding path program 1 times [2024-10-13 00:31:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267733555] [2024-10-13 00:31:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267733555] [2024-10-13 00:31:45,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267733555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:45,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:45,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:31:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867472333] [2024-10-13 00:31:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:45,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:31:45,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:45,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:31:45,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:31:45,187 INFO L87 Difference]: Start difference. First operand 784 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:45,499 INFO L93 Difference]: Finished difference Result 1509 states and 2386 transitions. [2024-10-13 00:31:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:31:45,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 249 [2024-10-13 00:31:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:45,506 INFO L225 Difference]: With dead ends: 1509 [2024-10-13 00:31:45,506 INFO L226 Difference]: Without dead ends: 926 [2024-10-13 00:31:45,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:45,509 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 138 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 727 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:45,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 727 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:31:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-13 00:31:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 770. [2024-10-13 00:31:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 598 states have (on average 1.4899665551839465) internal successors, (891), 600 states have internal predecessors, (891), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1213 transitions. [2024-10-13 00:31:45,645 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1213 transitions. Word has length 249 [2024-10-13 00:31:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1213 transitions. [2024-10-13 00:31:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1213 transitions. [2024-10-13 00:31:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:45,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:45,649 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:45,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 00:31:45,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:45,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1947649409, now seen corresponding path program 1 times [2024-10-13 00:31:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590865368] [2024-10-13 00:31:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590865368] [2024-10-13 00:31:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590865368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:46,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:31:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087957739] [2024-10-13 00:31:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:31:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:31:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:31:46,038 INFO L87 Difference]: Start difference. First operand 770 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:46,557 INFO L93 Difference]: Finished difference Result 1797 states and 2837 transitions. [2024-10-13 00:31:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:31:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-13 00:31:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:46,566 INFO L225 Difference]: With dead ends: 1797 [2024-10-13 00:31:46,567 INFO L226 Difference]: Without dead ends: 1474 [2024-10-13 00:31:46,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:31:46,569 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 303 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:46,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 700 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:31:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-10-13 00:31:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 790. [2024-10-13 00:31:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 618 states have (on average 1.493527508090615) internal successors, (923), 620 states have internal predecessors, (923), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1245 transitions. [2024-10-13 00:31:46,717 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1245 transitions. Word has length 250 [2024-10-13 00:31:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:46,718 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1245 transitions. [2024-10-13 00:31:46,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1245 transitions. [2024-10-13 00:31:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:46,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:46,723 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:46,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 00:31:46,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1130000959, now seen corresponding path program 1 times [2024-10-13 00:31:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406197756] [2024-10-13 00:31:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406197756] [2024-10-13 00:31:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406197756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:46,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:31:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341438088] [2024-10-13 00:31:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:46,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:31:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:31:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:31:46,984 INFO L87 Difference]: Start difference. First operand 790 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:47,243 INFO L93 Difference]: Finished difference Result 1305 states and 2061 transitions. [2024-10-13 00:31:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:31:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-13 00:31:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:47,251 INFO L225 Difference]: With dead ends: 1305 [2024-10-13 00:31:47,251 INFO L226 Difference]: Without dead ends: 946 [2024-10-13 00:31:47,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:47,253 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 138 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:47,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 530 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:31:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-13 00:31:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 790. [2024-10-13 00:31:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 618 states have (on average 1.4805825242718447) internal successors, (915), 620 states have internal predecessors, (915), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1237 transitions. [2024-10-13 00:31:47,369 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1237 transitions. Word has length 250 [2024-10-13 00:31:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:47,370 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1237 transitions. [2024-10-13 00:31:47,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1237 transitions. [2024-10-13 00:31:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:47,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:47,373 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:47,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 00:31:47,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 995987453, now seen corresponding path program 1 times [2024-10-13 00:31:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717735827] [2024-10-13 00:31:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:47,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717735827] [2024-10-13 00:31:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717735827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:31:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240834559] [2024-10-13 00:31:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:47,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:31:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:31:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:47,723 INFO L87 Difference]: Start difference. First operand 790 states and 1237 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:48,212 INFO L93 Difference]: Finished difference Result 1265 states and 1991 transitions. [2024-10-13 00:31:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:31:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-13 00:31:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:48,220 INFO L225 Difference]: With dead ends: 1265 [2024-10-13 00:31:48,220 INFO L226 Difference]: Without dead ends: 894 [2024-10-13 00:31:48,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:31:48,222 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 421 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:48,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 796 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:31:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-13 00:31:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 744. [2024-10-13 00:31:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 572 states have (on average 1.4737762237762237) internal successors, (843), 574 states have internal predecessors, (843), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1165 transitions. [2024-10-13 00:31:48,352 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1165 transitions. Word has length 250 [2024-10-13 00:31:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1165 transitions. [2024-10-13 00:31:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1165 transitions. [2024-10-13 00:31:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:48,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:48,356 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:48,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 00:31:48,357 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1505980648, now seen corresponding path program 1 times [2024-10-13 00:31:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050473104] [2024-10-13 00:31:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050473104] [2024-10-13 00:31:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050473104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:48,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:48,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:31:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137685436] [2024-10-13 00:31:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:31:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:31:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:31:48,658 INFO L87 Difference]: Start difference. First operand 744 states and 1165 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:48,971 INFO L93 Difference]: Finished difference Result 1723 states and 2722 transitions. [2024-10-13 00:31:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:31:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-13 00:31:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:48,979 INFO L225 Difference]: With dead ends: 1723 [2024-10-13 00:31:48,979 INFO L226 Difference]: Without dead ends: 1136 [2024-10-13 00:31:48,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:48,984 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 117 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:48,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 644 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:31:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-10-13 00:31:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 736. [2024-10-13 00:31:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 564 states have (on average 1.4627659574468086) internal successors, (825), 566 states have internal predecessors, (825), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-13 00:31:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1147 transitions. [2024-10-13 00:31:49,098 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1147 transitions. Word has length 250 [2024-10-13 00:31:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1147 transitions. [2024-10-13 00:31:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1147 transitions. [2024-10-13 00:31:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:49,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:49,102 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:49,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 00:31:49,103 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:49,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash -78823936, now seen corresponding path program 1 times [2024-10-13 00:31:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693720300] [2024-10-13 00:31:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:31:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:49,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693720300] [2024-10-13 00:31:49,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693720300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:49,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:49,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:31:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413508898] [2024-10-13 00:31:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:31:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:31:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:31:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:31:49,400 INFO L87 Difference]: Start difference. First operand 736 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:49,886 INFO L93 Difference]: Finished difference Result 1518 states and 2365 transitions. [2024-10-13 00:31:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:31:49,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-10-13 00:31:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:49,893 INFO L225 Difference]: With dead ends: 1518 [2024-10-13 00:31:49,894 INFO L226 Difference]: Without dead ends: 979 [2024-10-13 00:31:49,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:31:49,896 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 277 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:49,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 617 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:31:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-13 00:31:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 973. [2024-10-13 00:31:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 749 states have (on average 1.4632843791722296) internal successors, (1096), 753 states have internal predecessors, (1096), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2024-10-13 00:31:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1514 transitions. [2024-10-13 00:31:50,074 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1514 transitions. Word has length 250 [2024-10-13 00:31:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:50,075 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1514 transitions. [2024-10-13 00:31:50,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:31:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1514 transitions. [2024-10-13 00:31:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-13 00:31:50,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:50,078 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 00:31:50,078 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -896472386, now seen corresponding path program 1 times [2024-10-13 00:31:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:31:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533505136] [2024-10-13 00:31:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:31:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:31:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:31:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:31:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:31:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:31:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:31:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:31:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:31:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:31:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:31:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:31:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:31:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:31:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:31:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:31:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:31:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:31:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:31:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:31:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:31:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:31:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:31:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:31:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:31:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:31:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:31:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:31:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:31:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:31:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 00:31:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:31:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 00:31:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 00:31:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:31:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:31:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:31:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:31:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:31:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:31:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-13 00:31:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:31:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533505136] [2024-10-13 00:31:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533505136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:31:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752890928] [2024-10-13 00:31:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:50,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:31:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:31:50,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:31:50,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:31:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:50,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 00:31:50,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:31:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2024-10-13 00:31:51,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:31:51,624 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-13 00:31:51,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:31:51,829 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,SelfDestructingSolverStorable16 [2024-10-13 00:31:51,831 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0 at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 00:31:51,837 INFO L158 Benchmark]: Toolchain (without parser) took 21075.10ms. Allocated memory was 172.0MB in the beginning and 572.5MB in the end (delta: 400.6MB). Free memory was 139.5MB in the beginning and 375.8MB in the end (delta: -236.3MB). Peak memory consumption was 165.3MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,837 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:31:51,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.69ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 120.6MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.20ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 116.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,838 INFO L158 Benchmark]: Boogie Preprocessor took 89.51ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 111.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,839 INFO L158 Benchmark]: RCFGBuilder took 968.09ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 107.9MB in the end (delta: 3.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,839 INFO L158 Benchmark]: TraceAbstraction took 19409.06ms. Allocated memory was 172.0MB in the beginning and 572.5MB in the end (delta: 400.6MB). Free memory was 106.8MB in the beginning and 375.8MB in the end (delta: -268.9MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2024-10-13 00:31:51,843 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.69ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 120.6MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.20ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 116.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.51ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 111.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 968.09ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 107.9MB in the end (delta: 3.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19409.06ms. Allocated memory was 172.0MB in the beginning and 572.5MB in the end (delta: 400.6MB). Free memory was 106.8MB in the beginning and 375.8MB in the end (delta: -268.9MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-13 00:31:51,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:31:54,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:31:54,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:31:54,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:31:54,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:31:54,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:31:54,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:31:54,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:31:54,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:31:54,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:31:54,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:31:54,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:31:54,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:31:54,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:31:54,570 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:31:54,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:31:54,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:31:54,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:31:54,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:31:54,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:31:54,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:31:54,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:31:54,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:31:54,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:31:54,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:31:54,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:31:54,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:31:54,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:31:54,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:31:54,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:31:54,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:31:54,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:31:54,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:31:54,582 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:31:54,582 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:31:54,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:31:54,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:31:54,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:31:54,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:31:54,584 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:31:54,585 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-10-13 00:31:54,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:31:55,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:31:55,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:31:55,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:31:55,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:31:55,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:56,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:31:56,987 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:31:56,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:57,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0140545a5/bd2f53aa908b4b7f89638b357254e849/FLAG83f2be310 [2024-10-13 00:31:57,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0140545a5/bd2f53aa908b4b7f89638b357254e849 [2024-10-13 00:31:57,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:31:57,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:31:57,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:31:57,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:31:57,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:31:57,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fecf92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57, skipping insertion in model container [2024-10-13 00:31:57,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:31:57,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-13 00:31:57,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:31:57,348 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:31:57,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-10-13 00:31:57,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:31:57,456 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:31:57,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57 WrapperNode [2024-10-13 00:31:57,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:31:57,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:31:57,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:31:57,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:31:57,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,513 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-10-13 00:31:57,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:31:57,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:31:57,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:31:57,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:31:57,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:31:57,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:31:57,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:31:57,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:31:57,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:31:57,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (1/1) ... [2024-10-13 00:31:57,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:31:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:31:57,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:31:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:31:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:31:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:31:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:31:57,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:31:57,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:31:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:31:57,852 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:31:57,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:31:58,868 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:31:58,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:31:58,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:31:58,942 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:31:58,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:58 BoogieIcfgContainer [2024-10-13 00:31:58,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:31:58,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:31:58,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:31:58,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:31:58,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:31:57" (1/3) ... [2024-10-13 00:31:58,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957f247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:58, skipping insertion in model container [2024-10-13 00:31:58,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:57" (2/3) ... [2024-10-13 00:31:58,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957f247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:58, skipping insertion in model container [2024-10-13 00:31:58,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:58" (3/3) ... [2024-10-13 00:31:58,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-10-13 00:31:58,969 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:31:58,970 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:31:59,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:31:59,056 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;@4f328a16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:31:59,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:31:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-13 00:31:59,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:59,078 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:59,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash -34283185, now seen corresponding path program 1 times [2024-10-13 00:31:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:31:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532548722] [2024-10-13 00:31:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:59,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:31:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:31:59,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:31:59,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:31:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:59,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:31:59,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:31:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-10-13 00:31:59,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:31:59,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:31:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532548722] [2024-10-13 00:31:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532548722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:31:59,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:31:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:31:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424500078] [2024-10-13 00:31:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:31:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:31:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:31:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:31:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:31:59,757 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:31:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:59,853 INFO L93 Difference]: Finished difference Result 213 states and 397 transitions. [2024-10-13 00:31:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:31:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 242 [2024-10-13 00:31:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:59,869 INFO L225 Difference]: With dead ends: 213 [2024-10-13 00:31:59,869 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 00:31:59,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:31:59,881 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:59,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:31:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 00:31:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 00:31:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 65 states have internal predecessors, (95), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 00:31:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 173 transitions. [2024-10-13 00:31:59,934 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 173 transitions. Word has length 242 [2024-10-13 00:31:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 173 transitions. [2024-10-13 00:31:59,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:31:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions. [2024-10-13 00:31:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-13 00:31:59,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:59,941 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:59,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:32:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:00,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:32:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:32:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash -981239791, now seen corresponding path program 1 times [2024-10-13 00:32:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:32:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682349827] [2024-10-13 00:32:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:32:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:00,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:32:00,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:32:00,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:32:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:32:00,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:32:00,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:32:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:32:00,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:32:00,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:32:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682349827] [2024-10-13 00:32:00,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682349827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:32:00,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:32:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:32:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281626460] [2024-10-13 00:32:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:32:00,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:32:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:32:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:32:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:32:00,677 INFO L87 Difference]: Start difference. First operand 106 states and 173 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:32:00,927 INFO L93 Difference]: Finished difference Result 282 states and 461 transitions. [2024-10-13 00:32:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:32:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-10-13 00:32:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:32:00,931 INFO L225 Difference]: With dead ends: 282 [2024-10-13 00:32:00,932 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 00:32:00,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 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-10-13 00:32:00,934 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 110 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:32:00,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 415 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:32:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 00:32:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-10-13 00:32:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 111 states have internal predecessors, (162), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 00:32:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 284 transitions. [2024-10-13 00:32:00,978 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 284 transitions. Word has length 242 [2024-10-13 00:32:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:32:00,979 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 284 transitions. [2024-10-13 00:32:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 284 transitions. [2024-10-13 00:32:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-13 00:32:00,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:32:00,984 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:32:00,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 00:32:01,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:01,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:32:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:32:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash -558537965, now seen corresponding path program 1 times [2024-10-13 00:32:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:32:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504145164] [2024-10-13 00:32:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:32:01,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:01,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:32:01,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:32:01,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:32:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:32:01,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:32:01,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:32:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:32:03,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:32:03,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:32:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504145164] [2024-10-13 00:32:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504145164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:32:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:32:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:32:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470648100] [2024-10-13 00:32:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:32:03,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:32:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:32:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:32:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:32:03,145 INFO L87 Difference]: Start difference. First operand 174 states and 284 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:32:03,698 INFO L93 Difference]: Finished difference Result 485 states and 794 transitions. [2024-10-13 00:32:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:32:03,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-10-13 00:32:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:32:03,707 INFO L225 Difference]: With dead ends: 485 [2024-10-13 00:32:03,708 INFO L226 Difference]: Without dead ends: 312 [2024-10-13 00:32:03,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:32:03,710 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 129 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:32:03,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 587 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:32:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-13 00:32:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280. [2024-10-13 00:32:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.4772727272727273) internal successors, (260), 177 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-10-13 00:32:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 460 transitions. [2024-10-13 00:32:03,754 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 460 transitions. Word has length 242 [2024-10-13 00:32:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:32:03,755 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 460 transitions. [2024-10-13 00:32:03,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 460 transitions. [2024-10-13 00:32:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-13 00:32:03,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:32:03,759 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:32:03,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 00:32:03,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:03,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:32:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:32:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash 186491772, now seen corresponding path program 1 times [2024-10-13 00:32:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:32:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249931079] [2024-10-13 00:32:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:32:03,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:03,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:32:03,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:32:03,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 00:32:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:32:04,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 00:32:04,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:32:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2024-10-13 00:32:04,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:32:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-10-13 00:32:05,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:32:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249931079] [2024-10-13 00:32:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249931079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:32:05,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:32:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-13 00:32:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443123532] [2024-10-13 00:32:05,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:32:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:32:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:32:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:32:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:32:05,131 INFO L87 Difference]: Start difference. First operand 280 states and 460 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-13 00:32:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:32:06,142 INFO L93 Difference]: Finished difference Result 477 states and 764 transitions. [2024-10-13 00:32:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:32:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 243 [2024-10-13 00:32:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:32:06,149 INFO L225 Difference]: With dead ends: 477 [2024-10-13 00:32:06,151 INFO L226 Difference]: Without dead ends: 304 [2024-10-13 00:32:06,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-13 00:32:06,153 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 303 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:32:06,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 290 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:32:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-13 00:32:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2024-10-13 00:32:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 186 states have internal predecessors, (265), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 00:32:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 465 transitions. [2024-10-13 00:32:06,222 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 465 transitions. Word has length 243 [2024-10-13 00:32:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:32:06,224 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 465 transitions. [2024-10-13 00:32:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-13 00:32:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 465 transitions. [2024-10-13 00:32:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-13 00:32:06,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:32:06,230 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:32:06,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 00:32:06,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:06,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:32:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:32:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 675536760, now seen corresponding path program 1 times [2024-10-13 00:32:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:32:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740228599] [2024-10-13 00:32:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:32:06,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:32:06,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:32:06,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 00:32:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:32:06,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 00:32:06,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:32:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-10-13 00:32:07,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:32:07,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:32:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740228599] [2024-10-13 00:32:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740228599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:32:07,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:32:07,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:32:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796683545] [2024-10-13 00:32:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:32:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:32:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:32:07,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:32:07,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:32:07,099 INFO L87 Difference]: Start difference. First operand 292 states and 465 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:32:08,060 INFO L93 Difference]: Finished difference Result 481 states and 762 transitions. [2024-10-13 00:32:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:32:08,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-10-13 00:32:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:32:08,063 INFO L225 Difference]: With dead ends: 481 [2024-10-13 00:32:08,063 INFO L226 Difference]: Without dead ends: 300 [2024-10-13 00:32:08,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:32:08,065 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 136 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:32:08,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 426 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:32:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-13 00:32:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292. [2024-10-13 00:32:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 186 states have internal predecessors, (261), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 00:32:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 461 transitions. [2024-10-13 00:32:08,093 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 461 transitions. Word has length 244 [2024-10-13 00:32:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:32:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 461 transitions. [2024-10-13 00:32:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-10-13 00:32:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 461 transitions. [2024-10-13 00:32:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-13 00:32:08,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:32:08,096 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:32:08,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 00:32:08,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:08,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:32:08,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:32:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 620461943, now seen corresponding path program 1 times [2024-10-13 00:32:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:32:08,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074736163] [2024-10-13 00:32:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:32:08,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:32:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:32:08,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:32:08,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 00:32:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:32:08,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 00:32:08,614 INFO L278 TraceCheckSpWp]: Computing forward predicates...