./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercodestructure_filler-pr-ci_file-59.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 9c554204f9340f445d5caf6fceb919bd7ca7d94cde437779a40eaa60e7857908 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:24:39,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:24:40,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:24:40,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:24:40,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:24:40,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:24:40,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:24:40,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:24:40,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:24:40,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:24:40,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:24:40,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:24:40,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:24:40,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:24:40,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:24:40,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:24:40,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:24:40,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:24:40,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:24:40,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:24:40,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:24:40,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:24:40,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:24:40,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:24:40,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:24:40,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:24:40,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:24:40,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:24:40,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:24:40,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:24:40,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:24:40,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:24:40,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:24:40,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:24:40,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:24:40,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:24:40,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:24:40,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:24:40,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:24:40,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:24:40,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:24:40,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:24:40,106 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 -> 9c554204f9340f445d5caf6fceb919bd7ca7d94cde437779a40eaa60e7857908 [2024-11-16 14:24:40,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:24:40,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:24:40,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:24:40,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:24:40,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:24:40,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-16 14:24:41,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:24:42,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:24:42,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-16 14:24:42,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03f6c539/0c540481667d4953998a06e34ef1bf79/FLAG563c1aa49 [2024-11-16 14:24:42,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03f6c539/0c540481667d4953998a06e34ef1bf79 [2024-11-16 14:24:42,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:24:42,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:24:42,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:24:42,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:24:42,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:24:42,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c07263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42, skipping insertion in model container [2024-11-16 14:24:42,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:24:42,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i[919,932] [2024-11-16 14:24:42,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:24:42,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:24:42,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i[919,932] [2024-11-16 14:24:42,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:24:42,476 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:24:42,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42 WrapperNode [2024-11-16 14:24:42,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:24:42,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:24:42,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:24:42,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:24:42,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,549 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-16 14:24:42,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:24:42,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:24:42,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:24:42,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:24:42,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,587 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-16 14:24:42,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:24:42,616 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:24:42,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:24:42,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:24:42,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (1/1) ... [2024-11-16 14:24:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:24:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:42,656 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-16 14:24:42,662 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-16 14:24:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:24:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:24:42,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:24:42,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:24:42,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:24:42,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:24:42,849 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:24:42,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:24:43,391 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 14:24:43,391 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:24:43,416 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:24:43,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:24:43,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:43 BoogieIcfgContainer [2024-11-16 14:24:43,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:24:43,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:24:43,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:24:43,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:24:43,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:24:42" (1/3) ... [2024-11-16 14:24:43,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10090b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:43, skipping insertion in model container [2024-11-16 14:24:43,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:42" (2/3) ... [2024-11-16 14:24:43,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10090b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:43, skipping insertion in model container [2024-11-16 14:24:43,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:43" (3/3) ... [2024-11-16 14:24:43,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-16 14:24:43,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:24:43,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:24:43,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:24:43,519 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;@1ec7498a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:24:43,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:24:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 63 states have (on average 1.492063492063492) internal successors, (94), 64 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:24:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 14:24:43,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:43,535 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:43,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1422821718, now seen corresponding path program 1 times [2024-11-16 14:24:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32986742] [2024-11-16 14:24:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:24:43,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32986742] [2024-11-16 14:24:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32986742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:24:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082771722] [2024-11-16 14:24:43,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:44,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:24:44,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:24:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:24:44,032 INFO L87 Difference]: Start difference. First operand has 86 states, 63 states have (on average 1.492063492063492) internal successors, (94), 64 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:24:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:44,066 INFO L93 Difference]: Finished difference Result 164 states and 281 transitions. [2024-11-16 14:24:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:24:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-16 14:24:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:44,081 INFO L225 Difference]: With dead ends: 164 [2024-11-16 14:24:44,082 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 14:24:44,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-16 14:24:44,091 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:44,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:24:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 14:24:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 14:24:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:24:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-16 14:24:44,134 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 140 [2024-11-16 14:24:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:44,135 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-16 14:24:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:24:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-16 14:24:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 14:24:44,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:44,138 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:24:44,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1717438374, now seen corresponding path program 1 times [2024-11-16 14:24:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210983104] [2024-11-16 14:24:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:24:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210983104] [2024-11-16 14:24:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210983104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:24:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214607429] [2024-11-16 14:24:44,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:24:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:24:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:24:44,607 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:44,704 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2024-11-16 14:24:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:24:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-16 14:24:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:44,707 INFO L225 Difference]: With dead ends: 159 [2024-11-16 14:24:44,708 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 14:24:44,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-16 14:24:44,711 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:24:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 14:24:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 14:24:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:24:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-11-16 14:24:44,731 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 140 [2024-11-16 14:24:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:44,734 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-11-16 14:24:44,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-11-16 14:24:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 14:24:44,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:44,739 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:44,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:24:44,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:44,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1520924869, now seen corresponding path program 1 times [2024-11-16 14:24:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694318371] [2024-11-16 14:24:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:24:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694318371] [2024-11-16 14:24:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694318371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:24:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559453922] [2024-11-16 14:24:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:24:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:24:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:24:45,148 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:45,329 INFO L93 Difference]: Finished difference Result 239 states and 362 transitions. [2024-11-16 14:24:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:24:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-16 14:24:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:45,336 INFO L225 Difference]: With dead ends: 239 [2024-11-16 14:24:45,336 INFO L226 Difference]: Without dead ends: 161 [2024-11-16 14:24:45,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-16 14:24:45,340 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 110 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:45,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:24:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-16 14:24:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2024-11-16 14:24:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 14:24:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-11-16 14:24:45,394 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 140 [2024-11-16 14:24:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:45,394 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-11-16 14:24:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-11-16 14:24:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 14:24:45,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:45,401 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:45,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:24:45,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 232217833, now seen corresponding path program 1 times [2024-11-16 14:24:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933985534] [2024-11-16 14:24:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:24:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933985534] [2024-11-16 14:24:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933985534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:24:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106146650] [2024-11-16 14:24:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:24:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:24:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:24:45,742 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:45,884 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-11-16 14:24:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:24:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-16 14:24:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:45,888 INFO L225 Difference]: With dead ends: 288 [2024-11-16 14:24:45,888 INFO L226 Difference]: Without dead ends: 210 [2024-11-16 14:24:45,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-16 14:24:45,890 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 127 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:45,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 343 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:24:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-16 14:24:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2024-11-16 14:24:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 131 states have internal predecessors, (175), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:24:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 295 transitions. [2024-11-16 14:24:45,917 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 295 transitions. Word has length 141 [2024-11-16 14:24:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 295 transitions. [2024-11-16 14:24:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 295 transitions. [2024-11-16 14:24:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:24:45,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:45,920 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:45,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:24:45,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:45,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1465122050, now seen corresponding path program 1 times [2024-11-16 14:24:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63446399] [2024-11-16 14:24:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:24:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63446399] [2024-11-16 14:24:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63446399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:24:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296336849] [2024-11-16 14:24:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:24:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:24:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:24:46,552 INFO L87 Difference]: Start difference. First operand 195 states and 295 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:46,827 INFO L93 Difference]: Finished difference Result 444 states and 665 transitions. [2024-11-16 14:24:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 14:24:46,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 14:24:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:46,832 INFO L225 Difference]: With dead ends: 444 [2024-11-16 14:24:46,832 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 14:24:46,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:24:46,834 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 212 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:46,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 385 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:24:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 14:24:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 230. [2024-11-16 14:24:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 165 states have (on average 1.406060606060606) internal successors, (232), 165 states have internal predecessors, (232), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:24:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 352 transitions. [2024-11-16 14:24:46,872 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 352 transitions. Word has length 142 [2024-11-16 14:24:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:46,872 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 352 transitions. [2024-11-16 14:24:46,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:24:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 352 transitions. [2024-11-16 14:24:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:24:46,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:46,874 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:46,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:24:46,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1532128803, now seen corresponding path program 1 times [2024-11-16 14:24:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519586531] [2024-11-16 14:24:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:24:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:24:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:24:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:24:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:24:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:24:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:24:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 14:24:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519586531] [2024-11-16 14:24:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519586531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:24:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922420373] [2024-11-16 14:24:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:47,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:47,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:24:47,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:24:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:24:47,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 14:24:47,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 14:24:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922420373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:47,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:24:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 14:24:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326321405] [2024-11-16 14:24:47,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 14:24:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 14:24:47,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:24:47,827 INFO L87 Difference]: Start difference. First operand 230 states and 352 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-16 14:24:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:48,031 INFO L93 Difference]: Finished difference Result 417 states and 626 transitions. [2024-11-16 14:24:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:24:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 142 [2024-11-16 14:24:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:48,034 INFO L225 Difference]: With dead ends: 417 [2024-11-16 14:24:48,034 INFO L226 Difference]: Without dead ends: 247 [2024-11-16 14:24:48,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:24:48,036 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 151 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:48,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 193 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:24:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-16 14:24:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 209. [2024-11-16 14:24:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 141 states have internal predecessors, (175), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:24:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 295 transitions. [2024-11-16 14:24:48,064 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 295 transitions. Word has length 142 [2024-11-16 14:24:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 295 transitions. [2024-11-16 14:24:48,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-16 14:24:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 295 transitions. [2024-11-16 14:24:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 14:24:48,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:48,068 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:48,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 14:24:48,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 14:24:48,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1360964598, now seen corresponding path program 1 times [2024-11-16 14:24:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697032258] [2024-11-16 14:24:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:24:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581227915] [2024-11-16 14:24:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:48,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:24:48,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:24:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:48,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 14:24:48,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 159 proven. 51 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-16 14:24:48,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 14:24:49,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:49,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697032258] [2024-11-16 14:24:49,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 14:24:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581227915] [2024-11-16 14:24:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581227915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:49,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:24:49,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2024-11-16 14:24:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602353798] [2024-11-16 14:24:49,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:49,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 14:24:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 14:24:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 14:24:49,183 INFO L87 Difference]: Start difference. First operand 209 states and 295 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-16 14:24:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:49,595 INFO L93 Difference]: Finished difference Result 396 states and 553 transitions. [2024-11-16 14:24:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 14:24:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 147 [2024-11-16 14:24:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:49,599 INFO L225 Difference]: With dead ends: 396 [2024-11-16 14:24:49,599 INFO L226 Difference]: Without dead ends: 229 [2024-11-16 14:24:49,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:24:49,601 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:49,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 328 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:24:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-16 14:24:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2024-11-16 14:24:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 147 states have (on average 1.217687074829932) internal successors, (179), 147 states have internal predecessors, (179), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:24:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 299 transitions. [2024-11-16 14:24:49,626 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 299 transitions. Word has length 147 [2024-11-16 14:24:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:49,626 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 299 transitions. [2024-11-16 14:24:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-16 14:24:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 299 transitions. [2024-11-16 14:24:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 14:24:49,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:49,628 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:24:49,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 14:24:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-16 14:24:49,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1877834836, now seen corresponding path program 1 times [2024-11-16 14:24:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358777212] [2024-11-16 14:24:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:24:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141072111] [2024-11-16 14:24:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:49,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:49,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:24:49,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:24:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:50,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-16 14:24:50,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-16 14:24:52,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:25:01,397 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:25:13,690 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 14:25:26,010 WARN L286 SmtUtils]: Spent 12.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:25:42,167 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:25:50,408 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:25:54,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_10 Int)) (or (< v_z_10 .cse3) (< v_z_10 .cse1) (< .cse4 v_z_10) (not (= (mod (* v_z_10 .cse2) 4294967296) v_z_10)))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2024-11-16 14:26:18,737 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)