./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c3fff67c56135375ffd751199deaa864a3ed3a59a2eb1eeee2e19554b4f47694 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:51:58,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:51:59,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:51:59,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:51:59,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:51:59,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:51:59,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:51:59,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:51:59,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:51:59,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:51:59,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:51:59,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:51:59,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:51:59,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:51:59,064 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:51:59,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:51:59,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:51:59,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:51:59,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:51:59,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:51:59,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:51:59,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:51:59,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:51:59,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:51:59,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:51:59,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:51:59,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:51:59,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:51:59,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:51:59,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:51:59,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:51:59,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:51:59,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:51:59,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:51:59,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:51:59,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:51:59,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:51:59,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:51:59,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:51:59,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:51:59,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:51:59,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:51:59,074 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-clean/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-clean/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 -> c3fff67c56135375ffd751199deaa864a3ed3a59a2eb1eeee2e19554b4f47694 [2024-10-11 08:51:59,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:51:59,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:51:59,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:51:59,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:51:59,330 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:51:59,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2024-10-11 08:52:00,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:00,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:00,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2024-10-11 08:52:00,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8d59406d/a468bf9a769243c181026e4c59c8fd22/FLAGf77096ac3 [2024-10-11 08:52:01,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8d59406d/a468bf9a769243c181026e4c59c8fd22 [2024-10-11 08:52:01,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:01,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:01,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:01,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:01,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:01,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@babdb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01, skipping insertion in model container [2024-10-11 08:52:01,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:01,234 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i[919,932] [2024-10-11 08:52:01,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:01,438 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:01,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i[919,932] [2024-10-11 08:52:01,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:01,525 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:01,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01 WrapperNode [2024-10-11 08:52:01,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:01,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:01,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:01,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:01,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,593 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 298 [2024-10-11 08:52:01,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:01,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:01,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:01,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:01,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,640 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:52:01,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:01,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:01,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:01,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:01,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (1/1) ... [2024-10-11 08:52:01,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:01,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:01,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:52:01,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:52:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:01,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:52:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:01,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:01,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:01,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:02,460 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:02,460 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:02,490 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:02,490 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:02,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:02 BoogieIcfgContainer [2024-10-11 08:52:02,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:02,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:02,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:02,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:02,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:01" (1/3) ... [2024-10-11 08:52:02,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248aa9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:02, skipping insertion in model container [2024-10-11 08:52:02,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:01" (2/3) ... [2024-10-11 08:52:02,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248aa9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:02, skipping insertion in model container [2024-10-11 08:52:02,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:02" (3/3) ... [2024-10-11 08:52:02,501 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2024-10-11 08:52:02,518 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:02,519 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:02,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:02,612 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;@daacab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:02,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 85 states have internal predecessors, (124), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:52:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:52:02,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:02,641 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:02,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:02,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 348392225, now seen corresponding path program 1 times [2024-10-11 08:52:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184333646] [2024-10-11 08:52:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:52:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:52:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:52:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:52:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:52:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:52:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:52:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:52:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:52:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:52:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:52:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:52:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:52:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:52:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:52:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184333646] [2024-10-11 08:52:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184333646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:52:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082018607] [2024-10-11 08:52:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:03,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:52:03,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:52:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:03,390 INFO L87 Difference]: Start difference. First operand has 121 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 85 states have internal predecessors, (124), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:52:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:03,465 INFO L93 Difference]: Finished difference Result 239 states and 416 transitions. [2024-10-11 08:52:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:52:03,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-10-11 08:52:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:03,481 INFO L225 Difference]: With dead ends: 239 [2024-10-11 08:52:03,481 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 08:52:03,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:03,493 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:03,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 08:52:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 08:52:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:52:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 187 transitions. [2024-10-11 08:52:03,565 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 187 transitions. Word has length 215 [2024-10-11 08:52:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:03,566 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 187 transitions. [2024-10-11 08:52:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:52:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 187 transitions. [2024-10-11 08:52:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:52:03,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:03,574 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:52:03,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1816923481, now seen corresponding path program 1 times [2024-10-11 08:52:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142496923] [2024-10-11 08:52:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:52:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:52:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:52:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:52:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:52:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:52:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:52:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:52:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:52:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:52:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:52:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:52:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:52:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:52:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:52:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142496923] [2024-10-11 08:52:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142496923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463045101] [2024-10-11 08:52:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:04,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:04,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:04,451 INFO L87 Difference]: Start difference. First operand 119 states and 187 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:52:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:04,754 INFO L93 Difference]: Finished difference Result 356 states and 560 transitions. [2024-10-11 08:52:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:52:04,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 08:52:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:04,762 INFO L225 Difference]: With dead ends: 356 [2024-10-11 08:52:04,762 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 08:52:04,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:04,767 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 123 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:04,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 539 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 08:52:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 179. [2024-10-11 08:52:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 08:52:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2024-10-11 08:52:04,824 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 215 [2024-10-11 08:52:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:04,825 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2024-10-11 08:52:04,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:52:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2024-10-11 08:52:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:52:04,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:04,831 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:04,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:52:04,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:04,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -964910115, now seen corresponding path program 1 times [2024-10-11 08:52:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686127628] [2024-10-11 08:52:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:52:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:52:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:52:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:52:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:52:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:52:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:52:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:52:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:52:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:52:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:52:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:52:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:52:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:52:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:52:20,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686127628] [2024-10-11 08:52:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686127628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:20,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:20,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 08:52:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75985753] [2024-10-11 08:52:20,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 08:52:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 08:52:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 08:52:20,985 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:52:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:23,495 INFO L93 Difference]: Finished difference Result 501 states and 781 transitions. [2024-10-11 08:52:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 08:52:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-10-11 08:52:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:23,499 INFO L225 Difference]: With dead ends: 501 [2024-10-11 08:52:23,499 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 08:52:23,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2024-10-11 08:52:23,502 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1051 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:23,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 816 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 08:52:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 08:52:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 244. [2024-10-11 08:52:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 172 states have (on average 1.447674418604651) internal successors, (249), 172 states have internal predecessors, (249), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 08:52:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 385 transitions. [2024-10-11 08:52:23,544 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 385 transitions. Word has length 216 [2024-10-11 08:52:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:23,545 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 385 transitions. [2024-10-11 08:52:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:52:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 385 transitions. [2024-10-11 08:52:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:52:23,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:23,549 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:23,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:52:23,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1976027365, now seen corresponding path program 1 times [2024-10-11 08:52:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364143696] [2024-10-11 08:52:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:52:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:52:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:52:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:52:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:52:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:52:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:52:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:52:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:52:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:52:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:52:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:52:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:52:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:52:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:52:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364143696] [2024-10-11 08:52:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364143696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:23,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:23,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:52:23,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905334716] [2024-10-11 08:52:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:52:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:52:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:23,726 INFO L87 Difference]: Start difference. First operand 244 states and 385 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:52:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:23,775 INFO L93 Difference]: Finished difference Result 419 states and 660 transitions. [2024-10-11 08:52:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:52:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-10-11 08:52:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:23,779 INFO L225 Difference]: With dead ends: 419 [2024-10-11 08:52:23,779 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 08:52:23,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:23,782 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 85 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:23,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 377 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 08:52:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 275. [2024-10-11 08:52:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 194 states have (on average 1.4175257731958764) internal successors, (275), 195 states have internal predecessors, (275), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 08:52:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 427 transitions. [2024-10-11 08:52:23,816 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 427 transitions. Word has length 216 [2024-10-11 08:52:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:23,817 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 427 transitions. [2024-10-11 08:52:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:52:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 427 transitions. [2024-10-11 08:52:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:52:23,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:23,820 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:52:23,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1688996005, now seen corresponding path program 1 times [2024-10-11 08:52:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508175312] [2024-10-11 08:52:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:53:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:53:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:53:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:53:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:53:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:53:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:53:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:53:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:53:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:53:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:53:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:53:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:53:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:53:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:53:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:53:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:53:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:53:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:53:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:53:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:53:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:53:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:53:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:53:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:53:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:53:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:53:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:53:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:53:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:53:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:53:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:53:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:53:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:53:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:53:13,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:53:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508175312] [2024-10-11 08:53:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508175312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:53:13,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:53:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 08:53:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954746260] [2024-10-11 08:53:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:53:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 08:53:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:53:13,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 08:53:13,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 08:53:13,788 INFO L87 Difference]: Start difference. First operand 275 states and 427 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:53:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:53:16,604 INFO L93 Difference]: Finished difference Result 915 states and 1409 transitions. [2024-10-11 08:53:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 08:53:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-10-11 08:53:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:53:16,610 INFO L225 Difference]: With dead ends: 915 [2024-10-11 08:53:16,610 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 08:53:16,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-11 08:53:16,612 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1181 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:53:16,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1251 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 08:53:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 08:53:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 457. [2024-10-11 08:53:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 338 states have (on average 1.4171597633136095) internal successors, (479), 339 states have internal predecessors, (479), 110 states have call successors, (110), 8 states have call predecessors, (110), 8 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-11 08:53:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 699 transitions. [2024-10-11 08:53:16,666 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 699 transitions. Word has length 216 [2024-10-11 08:53:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:53:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 699 transitions. [2024-10-11 08:53:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:53:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 699 transitions. [2024-10-11 08:53:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:53:16,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:53:16,671 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:53:16,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:53:16,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:53:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:53:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -390920995, now seen corresponding path program 1 times [2024-10-11 08:53:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:53:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438797904] [2024-10-11 08:53:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:53:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:53:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat