./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:00:11,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:00:11,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:00:11,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:00:11,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:00:11,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:00:11,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:00:11,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:00:11,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:00:11,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:00:11,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:00:11,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:00:11,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:00:11,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:00:11,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:00:11,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:00:11,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:00:11,633 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:00:11,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:00:11,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:00:11,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:00:11,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:00:11,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:00:11,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:00:11,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:00:11,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:00:11,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:00:11,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:00:11,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:00:11,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:00:11,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:00:11,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:00:11,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:11,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:00:11,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:00:11,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:00:11,640 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-08 20:00:11,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:00:11,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:00:11,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:00:11,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:00:11,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:00:11,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:13,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:00:13,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:00:13,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:13,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ab86fbf/c4b7e62415f242d4b9112b054f5f368e/FLAG394119950 [2024-11-08 20:00:13,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ab86fbf/c4b7e62415f242d4b9112b054f5f368e [2024-11-08 20:00:13,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:00:13,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:00:13,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:13,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:00:13,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:00:13,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:13,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527043a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13, skipping insertion in model container [2024-11-08 20:00:13,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:13,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:00:13,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-08 20:00:13,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:13,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:00:13,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-08 20:00:13,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:13,956 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:00:13,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13 WrapperNode [2024-11-08 20:00:13,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:13,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:13,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:00:13,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:00:13,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:13,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,023 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-08 20:00:14,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:14,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:00:14,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:00:14,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:00:14,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:00:14,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:00:14,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:00:14,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:00:14,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:00:14,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (1/1) ... [2024-11-08 20:00:14,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:00:14,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:00:14,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:00:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:00:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:00:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:00:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:00:14,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:00:14,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:00:14,489 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 20:00:14,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:00:14,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:00:14,499 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:00:14,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:14 BoogieIcfgContainer [2024-11-08 20:00:14,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:00:14,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:00:14,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:00:14,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:00:14,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:00:13" (1/3) ... [2024-11-08 20:00:14,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e58e917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:14, skipping insertion in model container [2024-11-08 20:00:14,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:13" (2/3) ... [2024-11-08 20:00:14,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e58e917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:14, skipping insertion in model container [2024-11-08 20:00:14,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:14" (3/3) ... [2024-11-08 20:00:14,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:14,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:00:14,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:00:14,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:00:14,564 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;@164d899e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:00:14,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:00:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:14,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:14,576 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:14,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -443072802, now seen corresponding path program 1 times [2024-11-08 20:00:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473117787] [2024-11-08 20:00:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473117787] [2024-11-08 20:00:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473117787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:00:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030591681] [2024-11-08 20:00:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:14,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:00:14,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:00:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:14,876 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 20:00:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:14,897 INFO L93 Difference]: Finished difference Result 137 states and 222 transitions. [2024-11-08 20:00:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:00:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-11-08 20:00:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:14,906 INFO L225 Difference]: With dead ends: 137 [2024-11-08 20:00:14,906 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 20:00:14,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:14,912 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:14,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 20:00:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 20:00:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-08 20:00:14,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116 [2024-11-08 20:00:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:14,947 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-08 20:00:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 20:00:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-08 20:00:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:14,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:14,952 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:00:14,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 811653010, now seen corresponding path program 1 times [2024-11-08 20:00:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046452392] [2024-11-08 20:00:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046452392] [2024-11-08 20:00:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046452392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:15,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:00:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101576535] [2024-11-08 20:00:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:15,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:00:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:00:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:15,166 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:15,216 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2024-11-08 20:00:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:00:15,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 20:00:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:15,219 INFO L225 Difference]: With dead ends: 163 [2024-11-08 20:00:15,220 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 20:00:15,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:15,222 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:15,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 20:00:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-11-08 20:00:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-08 20:00:15,238 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116 [2024-11-08 20:00:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:15,240 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-08 20:00:15,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-08 20:00:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:15,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:15,243 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:15,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:00:15,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:15,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1524127698, now seen corresponding path program 1 times [2024-11-08 20:00:15,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:15,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919835317] [2024-11-08 20:00:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919835317] [2024-11-08 20:00:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919835317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:15,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:00:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645092105] [2024-11-08 20:00:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:00:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:00:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:00:15,589 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:15,742 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2024-11-08 20:00:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:00:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 20:00:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:15,744 INFO L225 Difference]: With dead ends: 230 [2024-11-08 20:00:15,745 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 20:00:15,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:00:15,746 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:15,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:00:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 20:00:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101. [2024-11-08 20:00:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-11-08 20:00:15,770 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 116 [2024-11-08 20:00:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-11-08 20:00:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-11-08 20:00:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:15,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:15,772 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:15,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:00:15,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:15,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2110933712, now seen corresponding path program 1 times [2024-11-08 20:00:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913170708] [2024-11-08 20:00:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:16,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:16,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913170708] [2024-11-08 20:00:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913170708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:16,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:16,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:00:16,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13461644] [2024-11-08 20:00:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:16,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:00:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:00:16,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:00:16,057 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:16,616 INFO L93 Difference]: Finished difference Result 537 states and 781 transitions. [2024-11-08 20:00:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:00:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 20:00:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:16,621 INFO L225 Difference]: With dead ends: 537 [2024-11-08 20:00:16,621 INFO L226 Difference]: Without dead ends: 439 [2024-11-08 20:00:16,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:00:16,623 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 344 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:16,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 958 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:00:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-08 20:00:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 235. [2024-11-08 20:00:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.41) internal successors, (282), 200 states have internal predecessors, (282), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 20:00:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2024-11-08 20:00:16,649 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 116 [2024-11-08 20:00:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:16,650 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2024-11-08 20:00:16,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2024-11-08 20:00:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:16,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:16,652 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:16,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:00:16,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1099816462, now seen corresponding path program 1 times [2024-11-08 20:00:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093989198] [2024-11-08 20:00:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093989198] [2024-11-08 20:00:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093989198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:16,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:00:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258749011] [2024-11-08 20:00:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:16,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:00:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:16,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:00:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:00:16,857 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:16,926 INFO L93 Difference]: Finished difference Result 678 states and 1002 transitions. [2024-11-08 20:00:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:00:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 20:00:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:16,929 INFO L225 Difference]: With dead ends: 678 [2024-11-08 20:00:16,929 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 20:00:16,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:00:16,931 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:16,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 410 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 20:00:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2024-11-08 20:00:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 373 states have (on average 1.4048257372654156) internal successors, (524), 373 states have internal predecessors, (524), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 652 transitions. [2024-11-08 20:00:16,971 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 652 transitions. Word has length 116 [2024-11-08 20:00:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:16,971 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 652 transitions. [2024-11-08 20:00:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 652 transitions. [2024-11-08 20:00:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 20:00:16,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:16,978 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:16,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:00:16,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1917464912, now seen corresponding path program 1 times [2024-11-08 20:00:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774990422] [2024-11-08 20:00:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774990422] [2024-11-08 20:00:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774990422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:00:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697470115] [2024-11-08 20:00:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:17,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:00:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:00:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:00:17,219 INFO L87 Difference]: Start difference. First operand 442 states and 652 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:17,493 INFO L93 Difference]: Finished difference Result 1111 states and 1630 transitions. [2024-11-08 20:00:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:00:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 20:00:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:17,498 INFO L225 Difference]: With dead ends: 1111 [2024-11-08 20:00:17,499 INFO L226 Difference]: Without dead ends: 672 [2024-11-08 20:00:17,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-11-08 20:00:17,501 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 197 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:17,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 329 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-08 20:00:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 456. [2024-11-08 20:00:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 387 states have (on average 1.3772609819121446) internal successors, (533), 387 states have internal predecessors, (533), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 661 transitions. [2024-11-08 20:00:17,550 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 661 transitions. Word has length 116 [2024-11-08 20:00:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:17,550 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 661 transitions. [2024-11-08 20:00:17,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 661 transitions. [2024-11-08 20:00:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 20:00:17,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:17,552 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:17,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:00:17,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:17,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2007101273, now seen corresponding path program 1 times [2024-11-08 20:00:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:17,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675853720] [2024-11-08 20:00:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675853720] [2024-11-08 20:00:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675853720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:00:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654515072] [2024-11-08 20:00:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:00:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:17,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:00:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:00:17,746 INFO L87 Difference]: Start difference. First operand 456 states and 661 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:17,964 INFO L93 Difference]: Finished difference Result 1186 states and 1717 transitions. [2024-11-08 20:00:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:00:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 20:00:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:17,968 INFO L225 Difference]: With dead ends: 1186 [2024-11-08 20:00:17,968 INFO L226 Difference]: Without dead ends: 733 [2024-11-08 20:00:17,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:00:17,972 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 211 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:17,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 104 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:00:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-08 20:00:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 460. [2024-11-08 20:00:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 391 states have internal predecessors, (537), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 665 transitions. [2024-11-08 20:00:18,036 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 665 transitions. Word has length 117 [2024-11-08 20:00:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 665 transitions. [2024-11-08 20:00:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2024-11-08 20:00:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 20:00:18,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:18,039 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:00:18,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1420295259, now seen corresponding path program 1 times [2024-11-08 20:00:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055188565] [2024-11-08 20:00:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:18,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055188565] [2024-11-08 20:00:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055188565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:18,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:18,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:00:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551271819] [2024-11-08 20:00:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:00:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:00:18,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:00:18,582 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:19,508 INFO L93 Difference]: Finished difference Result 1229 states and 1768 transitions. [2024-11-08 20:00:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 20:00:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 20:00:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:19,512 INFO L225 Difference]: With dead ends: 1229 [2024-11-08 20:00:19,512 INFO L226 Difference]: Without dead ends: 771 [2024-11-08 20:00:19,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 20:00:19,513 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 246 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:19,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1423 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 20:00:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-08 20:00:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 502. [2024-11-08 20:00:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 433 states have (on average 1.3764434180138567) internal successors, (596), 433 states have internal predecessors, (596), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2024-11-08 20:00:19,548 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 117 [2024-11-08 20:00:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:19,549 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2024-11-08 20:00:19,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2024-11-08 20:00:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 20:00:19,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:19,550 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:19,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:00:19,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:19,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1842997085, now seen corresponding path program 1 times [2024-11-08 20:00:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194824253] [2024-11-08 20:00:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194824253] [2024-11-08 20:00:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194824253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:00:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367901197] [2024-11-08 20:00:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:19,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:00:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:00:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:00:19,747 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:20,013 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2024-11-08 20:00:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:00:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 20:00:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:20,017 INFO L225 Difference]: With dead ends: 1225 [2024-11-08 20:00:20,017 INFO L226 Difference]: Without dead ends: 726 [2024-11-08 20:00:20,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:00:20,019 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:20,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 570 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-08 20:00:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 532. [2024-11-08 20:00:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 463 states have (on average 1.3736501079913608) internal successors, (636), 463 states have internal predecessors, (636), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2024-11-08 20:00:20,074 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 764 transitions. Word has length 117 [2024-11-08 20:00:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:20,075 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 764 transitions. [2024-11-08 20:00:20,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 764 transitions. [2024-11-08 20:00:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 20:00:20,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:20,076 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:20,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:00:20,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash 674571830, now seen corresponding path program 1 times [2024-11-08 20:00:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47540047] [2024-11-08 20:00:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47540047] [2024-11-08 20:00:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47540047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:00:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286230418] [2024-11-08 20:00:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:20,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:00:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:00:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:00:20,438 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:20,957 INFO L93 Difference]: Finished difference Result 1255 states and 1792 transitions. [2024-11-08 20:00:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:00:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 20:00:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:20,960 INFO L225 Difference]: With dead ends: 1255 [2024-11-08 20:00:20,960 INFO L226 Difference]: Without dead ends: 726 [2024-11-08 20:00:20,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:00:20,962 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 178 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:20,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 822 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:00:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-08 20:00:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 574. [2024-11-08 20:00:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 505 states have (on average 1.3702970297029704) internal successors, (692), 505 states have internal predecessors, (692), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2024-11-08 20:00:21,006 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 118 [2024-11-08 20:00:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:21,006 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2024-11-08 20:00:21,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2024-11-08 20:00:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 20:00:21,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:21,007 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:00:21,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 155630701, now seen corresponding path program 1 times [2024-11-08 20:00:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359285786] [2024-11-08 20:00:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359285786] [2024-11-08 20:00:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359285786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:21,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:21,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:00:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98005375] [2024-11-08 20:00:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:21,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:00:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:00:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:00:21,363 INFO L87 Difference]: Start difference. First operand 574 states and 820 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:21,670 INFO L93 Difference]: Finished difference Result 1435 states and 2000 transitions. [2024-11-08 20:00:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:00:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 20:00:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:21,673 INFO L225 Difference]: With dead ends: 1435 [2024-11-08 20:00:21,673 INFO L226 Difference]: Without dead ends: 864 [2024-11-08 20:00:21,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:00:21,675 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 94 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:21,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 720 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-08 20:00:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 592. [2024-11-08 20:00:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 523 states have (on average 1.2848948374760993) internal successors, (672), 523 states have internal predecessors, (672), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 800 transitions. [2024-11-08 20:00:21,717 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 800 transitions. Word has length 118 [2024-11-08 20:00:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:21,717 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 800 transitions. [2024-11-08 20:00:21,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 800 transitions. [2024-11-08 20:00:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 20:00:21,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:21,731 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 20:00:21,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 455717112, now seen corresponding path program 1 times [2024-11-08 20:00:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645243053] [2024-11-08 20:00:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645243053] [2024-11-08 20:00:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645243053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:00:21,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511743464] [2024-11-08 20:00:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:00:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:00:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:00:21,909 INFO L87 Difference]: Start difference. First operand 592 states and 800 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:22,146 INFO L93 Difference]: Finished difference Result 1088 states and 1477 transitions. [2024-11-08 20:00:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:00:22,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 20:00:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:22,152 INFO L225 Difference]: With dead ends: 1088 [2024-11-08 20:00:22,152 INFO L226 Difference]: Without dead ends: 809 [2024-11-08 20:00:22,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:00:22,154 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 66 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:22,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 561 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:00:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-08 20:00:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 628. [2024-11-08 20:00:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 559 states have (on average 1.2737030411449015) internal successors, (712), 559 states have internal predecessors, (712), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 840 transitions. [2024-11-08 20:00:22,230 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 840 transitions. Word has length 118 [2024-11-08 20:00:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:22,230 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 840 transitions. [2024-11-08 20:00:22,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 840 transitions. [2024-11-08 20:00:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:22,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:22,232 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:22,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 20:00:22,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:22,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2131865737, now seen corresponding path program 1 times [2024-11-08 20:00:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:22,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648529203] [2024-11-08 20:00:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648529203] [2024-11-08 20:00:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648529203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:00:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743380391] [2024-11-08 20:00:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:00:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:00:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:00:22,369 INFO L87 Difference]: Start difference. First operand 628 states and 840 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:22,723 INFO L93 Difference]: Finished difference Result 1662 states and 2225 transitions. [2024-11-08 20:00:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:00:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:22,727 INFO L225 Difference]: With dead ends: 1662 [2024-11-08 20:00:22,727 INFO L226 Difference]: Without dead ends: 1037 [2024-11-08 20:00:22,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:00:22,729 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 294 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:22,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 269 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-08 20:00:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 686. [2024-11-08 20:00:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 617 states have (on average 1.2625607779578607) internal successors, (779), 617 states have internal predecessors, (779), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 907 transitions. [2024-11-08 20:00:22,791 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 907 transitions. Word has length 119 [2024-11-08 20:00:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 907 transitions. [2024-11-08 20:00:22,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 907 transitions. [2024-11-08 20:00:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:22,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:22,793 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:22,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 20:00:22,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1483043189, now seen corresponding path program 1 times [2024-11-08 20:00:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806009221] [2024-11-08 20:00:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806009221] [2024-11-08 20:00:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806009221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:23,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:00:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118477624] [2024-11-08 20:00:23,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:00:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:00:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:00:23,047 INFO L87 Difference]: Start difference. First operand 686 states and 907 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:23,346 INFO L93 Difference]: Finished difference Result 1338 states and 1786 transitions. [2024-11-08 20:00:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:00:23,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:23,349 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 20:00:23,349 INFO L226 Difference]: Without dead ends: 653 [2024-11-08 20:00:23,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:00:23,351 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 126 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:23,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 377 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-08 20:00:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 609. [2024-11-08 20:00:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.2555555555555555) internal successors, (678), 540 states have internal predecessors, (678), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 806 transitions. [2024-11-08 20:00:23,399 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 806 transitions. Word has length 119 [2024-11-08 20:00:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:23,399 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 806 transitions. [2024-11-08 20:00:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 806 transitions. [2024-11-08 20:00:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:23,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:23,401 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:23,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 20:00:23,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:23,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 347401600, now seen corresponding path program 1 times [2024-11-08 20:00:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853162692] [2024-11-08 20:00:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853162692] [2024-11-08 20:00:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853162692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:23,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:23,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:00:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944550938] [2024-11-08 20:00:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:00:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:23,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:00:23,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:23,453 INFO L87 Difference]: Start difference. First operand 609 states and 806 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:23,547 INFO L93 Difference]: Finished difference Result 1352 states and 1799 transitions. [2024-11-08 20:00:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:00:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:23,551 INFO L225 Difference]: With dead ends: 1352 [2024-11-08 20:00:23,552 INFO L226 Difference]: Without dead ends: 746 [2024-11-08 20:00:23,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:23,554 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:23,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 181 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-08 20:00:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 609. [2024-11-08 20:00:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.2481481481481482) internal successors, (674), 540 states have internal predecessors, (674), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 802 transitions. [2024-11-08 20:00:23,606 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 802 transitions. Word has length 119 [2024-11-08 20:00:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 802 transitions. [2024-11-08 20:00:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 802 transitions. [2024-11-08 20:00:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:23,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:23,608 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:23,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 20:00:23,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:23,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 322395145, now seen corresponding path program 1 times [2024-11-08 20:00:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:23,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709531406] [2024-11-08 20:00:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709531406] [2024-11-08 20:00:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709531406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:23,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:23,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:00:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144288677] [2024-11-08 20:00:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:00:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:00:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:00:23,904 INFO L87 Difference]: Start difference. First operand 609 states and 802 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:24,156 INFO L93 Difference]: Finished difference Result 1197 states and 1543 transitions. [2024-11-08 20:00:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:00:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:24,160 INFO L225 Difference]: With dead ends: 1197 [2024-11-08 20:00:24,160 INFO L226 Difference]: Without dead ends: 851 [2024-11-08 20:00:24,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:00:24,161 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:24,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 715 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-08 20:00:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 619. [2024-11-08 20:00:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 550 states have (on average 1.2454545454545454) internal successors, (685), 550 states have internal predecessors, (685), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 813 transitions. [2024-11-08 20:00:24,234 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 813 transitions. Word has length 119 [2024-11-08 20:00:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:24,234 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 813 transitions. [2024-11-08 20:00:24,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 813 transitions. [2024-11-08 20:00:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:24,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:24,236 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:24,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 20:00:24,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:24,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2000934546, now seen corresponding path program 1 times [2024-11-08 20:00:24,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517815306] [2024-11-08 20:00:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517815306] [2024-11-08 20:00:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517815306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:00:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697572616] [2024-11-08 20:00:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:00:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:00:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:00:24,565 INFO L87 Difference]: Start difference. First operand 619 states and 813 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:24,812 INFO L93 Difference]: Finished difference Result 1148 states and 1484 transitions. [2024-11-08 20:00:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:00:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:24,815 INFO L225 Difference]: With dead ends: 1148 [2024-11-08 20:00:24,815 INFO L226 Difference]: Without dead ends: 792 [2024-11-08 20:00:24,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:00:24,816 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 53 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:24,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 621 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:00:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-08 20:00:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 611. [2024-11-08 20:00:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 542 states have (on average 1.2490774907749078) internal successors, (677), 542 states have internal predecessors, (677), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 805 transitions. [2024-11-08 20:00:24,876 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 805 transitions. Word has length 119 [2024-11-08 20:00:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:24,877 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 805 transitions. [2024-11-08 20:00:24,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 805 transitions. [2024-11-08 20:00:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:24,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:24,879 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:24,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 20:00:24,879 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:24,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1009036655, now seen corresponding path program 1 times [2024-11-08 20:00:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:24,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459896413] [2024-11-08 20:00:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459896413] [2024-11-08 20:00:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459896413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:24,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:00:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205692269] [2024-11-08 20:00:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:24,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:00:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:00:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:24,941 INFO L87 Difference]: Start difference. First operand 611 states and 805 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:25,056 INFO L93 Difference]: Finished difference Result 1397 states and 1856 transitions. [2024-11-08 20:00:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:00:25,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:25,060 INFO L225 Difference]: With dead ends: 1397 [2024-11-08 20:00:25,060 INFO L226 Difference]: Without dead ends: 789 [2024-11-08 20:00:25,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:25,062 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:25,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-08 20:00:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 577. [2024-11-08 20:00:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 508 states have (on average 1.2460629921259843) internal successors, (633), 508 states have internal predecessors, (633), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 761 transitions. [2024-11-08 20:00:25,122 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 761 transitions. Word has length 119 [2024-11-08 20:00:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 761 transitions. [2024-11-08 20:00:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 761 transitions. [2024-11-08 20:00:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 20:00:25,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:25,124 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 20:00:25,124 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -707217664, now seen corresponding path program 1 times [2024-11-08 20:00:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974311069] [2024-11-08 20:00:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:00:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 20:00:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:00:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:00:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 20:00:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 20:00:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 20:00:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 20:00:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 20:00:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974311069] [2024-11-08 20:00:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974311069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:25,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:25,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:00:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599525068] [2024-11-08 20:00:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:25,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:00:25,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:25,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:00:25,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:25,180 INFO L87 Difference]: Start difference. First operand 577 states and 761 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:25,303 INFO L93 Difference]: Finished difference Result 1329 states and 1764 transitions. [2024-11-08 20:00:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:00:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 20:00:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:25,306 INFO L225 Difference]: With dead ends: 1329 [2024-11-08 20:00:25,307 INFO L226 Difference]: Without dead ends: 755 [2024-11-08 20:00:25,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:25,308 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:25,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-08 20:00:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 577. [2024-11-08 20:00:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 508 states have (on average 1.234251968503937) internal successors, (627), 508 states have internal predecessors, (627), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 20:00:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 755 transitions. [2024-11-08 20:00:25,366 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 755 transitions. Word has length 119 [2024-11-08 20:00:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:25,367 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 755 transitions. [2024-11-08 20:00:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 755 transitions. [2024-11-08 20:00:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 20:00:25,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:25,369 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 20:00:25,370 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash -824987695, now seen corresponding path program 1 times [2024-11-08 20:00:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983426703] [2024-11-08 20:00:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:00:25,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:00:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:00:25,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:00:25,469 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:00:25,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:00:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 20:00:25,474 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:25,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:00:25,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:00:25 BoogieIcfgContainer [2024-11-08 20:00:25,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:00:25,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:00:25,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:00:25,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:00:25,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:14" (3/4) ... [2024-11-08 20:00:25,554 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:00:25,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:00:25,555 INFO L158 Benchmark]: Toolchain (without parser) took 11902.23ms. Allocated memory was 176.2MB in the beginning and 463.5MB in the end (delta: 287.3MB). Free memory was 98.7MB in the beginning and 274.6MB in the end (delta: -175.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,556 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:00:25,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.56ms. Allocated memory is still 176.2MB. Free memory was 98.5MB in the beginning and 146.0MB in the end (delta: -47.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.13ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 142.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,556 INFO L158 Benchmark]: Boogie Preprocessor took 45.06ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 137.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,557 INFO L158 Benchmark]: RCFGBuilder took 430.19ms. Allocated memory is still 176.2MB. Free memory was 137.2MB in the beginning and 114.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,557 INFO L158 Benchmark]: TraceAbstraction took 11050.30ms. Allocated memory was 176.2MB in the beginning and 463.5MB in the end (delta: 287.3MB). Free memory was 113.6MB in the beginning and 275.7MB in the end (delta: -162.1MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-11-08 20:00:25,557 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 463.5MB. Free memory is still 274.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:00:25,558 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.10ms. Allocated memory is still 176.2MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.56ms. Allocated memory is still 176.2MB. Free memory was 98.5MB in the beginning and 146.0MB in the end (delta: -47.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.13ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 142.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.06ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 137.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 430.19ms. Allocated memory is still 176.2MB. Free memory was 137.2MB in the beginning and 114.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11050.30ms. Allocated memory was 176.2MB in the beginning and 463.5MB in the end (delta: 287.3MB). Free memory was 113.6MB in the beginning and 275.7MB in the end (delta: -162.1MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 463.5MB. Free memory is still 274.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2512 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2512 mSDsluCounter, 8941 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6284 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3463 IncrementalHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 2657 mSDtfsCounter, 3463 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=13, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 3168 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2354 NumberOfCodeBlocks, 2354 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2215 ConstructedInterpolants, 0 QuantifiedInterpolants, 5447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:00:25,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:00:27,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:00:27,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:00:27,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:00:27,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:00:27,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:00:27,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:00:27,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:00:27,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:00:27,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:00:27,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:00:27,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:00:27,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:00:27,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:00:27,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:00:27,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:00:27,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:00:27,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:00:27,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:00:27,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:00:27,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:00:27,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:00:27,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:00:27,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:00:27,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:00:27,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:00:27,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:00:27,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:00:27,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:00:27,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:00:27,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:00:27,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:00:27,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:00:27,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:00:27,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:27,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:00:27,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:00:27,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:00:27,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:00:27,521 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-08 20:00:27,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:00:27,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:00:27,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:00:27,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:00:27,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:00:27,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:29,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:00:29,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:00:29,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:29,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba5c91e4/0290fa06b52f43afa29f6309e5eb4fe9/FLAG7256431b4 [2024-11-08 20:00:29,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba5c91e4/0290fa06b52f43afa29f6309e5eb4fe9 [2024-11-08 20:00:29,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:00:29,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:00:29,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:29,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:00:29,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:00:29,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48142aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29, skipping insertion in model container [2024-11-08 20:00:29,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:00:29,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-08 20:00:29,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:29,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:00:29,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-08 20:00:29,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:29,592 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:00:29,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29 WrapperNode [2024-11-08 20:00:29,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:29,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:29,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:00:29,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:00:29,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,646 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-08 20:00:29,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:29,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:00:29,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:00:29,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:00:29,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:00:29,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:00:29,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:00:29,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:00:29,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:00:29,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (1/1) ... [2024-11-08 20:00:29,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:00:29,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:00:29,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:00:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:00:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:00:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:00:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:00:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:00:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:00:29,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:00:29,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:00:33,907 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:00:33,908 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:00:33,916 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:00:33,918 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:00:33,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:33 BoogieIcfgContainer [2024-11-08 20:00:33,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:00:33,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:00:33,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:00:33,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:00:33,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:00:29" (1/3) ... [2024-11-08 20:00:33,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a77a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:33, skipping insertion in model container [2024-11-08 20:00:33,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:29" (2/3) ... [2024-11-08 20:00:33,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a77a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:33, skipping insertion in model container [2024-11-08 20:00:33,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:33" (3/3) ... [2024-11-08 20:00:33,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-08 20:00:33,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:00:33,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:00:33,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:00:33,997 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;@2c37465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:00:33,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:00:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 20:00:34,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:34,012 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:34,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 784188602, now seen corresponding path program 1 times [2024-11-08 20:00:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:00:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033818019] [2024-11-08 20:00:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:34,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:00:34,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:00:34,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:00:34,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:00:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:34,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:00:34,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:00:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-08 20:00:34,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:00:34,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:00:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033818019] [2024-11-08 20:00:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033818019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:00:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759762316] [2024-11-08 20:00:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:00:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:00:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:00:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:34,442 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 20:00:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:34,461 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2024-11-08 20:00:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:00:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-08 20:00:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:34,468 INFO L225 Difference]: With dead ends: 109 [2024-11-08 20:00:34,468 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 20:00:34,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:34,472 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:34,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 20:00:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 20:00:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-08 20:00:34,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2024-11-08 20:00:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:34,514 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-08 20:00:34,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 20:00:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-08 20:00:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 20:00:34,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:34,520 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:34,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:00:34,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:00:34,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:34,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1409610862, now seen corresponding path program 1 times [2024-11-08 20:00:34,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:00:34,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608874340] [2024-11-08 20:00:34,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:34,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:00:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:00:34,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:00:34,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:00:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:35,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:00:35,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:00:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 20:00:35,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:00:35,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:00:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608874340] [2024-11-08 20:00:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608874340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:35,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:00:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358008705] [2024-11-08 20:00:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:00:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:00:35,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:00:35,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:35,113 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:38,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:00:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:38,632 INFO L93 Difference]: Finished difference Result 121 states and 175 transitions. [2024-11-08 20:00:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:00:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-08 20:00:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:38,638 INFO L225 Difference]: With dead ends: 121 [2024-11-08 20:00:38,638 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 20:00:38,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:00:38,640 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:38,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 20:00:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 20:00:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-11-08 20:00:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 20:00:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-08 20:00:38,653 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 110 [2024-11-08 20:00:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:38,654 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-08 20:00:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 20:00:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-08 20:00:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 20:00:38,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:38,656 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:38,668 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:00:38,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:00:38,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:38,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1926126418, now seen corresponding path program 1 times [2024-11-08 20:00:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:00:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930223343] [2024-11-08 20:00:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:38,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:00:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:00:38,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:00:38,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:00:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:39,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 20:00:39,205 INFO L278 TraceCheckSpWp]: Computing forward predicates...