./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:38:10,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:38:10,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:38:10,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:38:10,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:38:10,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:38:10,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:38:10,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:38:10,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:38:10,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:38:10,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:38:10,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:38:10,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:38:10,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:38:10,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:38:10,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:38:10,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:38:10,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:38:10,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:38:10,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:38:10,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:38:10,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:38:10,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:38:10,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:38:10,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:38:10,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:38:10,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:38:10,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:38:10,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:38:10,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:38:10,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:38:10,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:38:10,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:38:10,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:38:10,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:38:10,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:38:10,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:38:10,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:38:10,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:38:10,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:38:10,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:38:10,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:38:10,742 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2024-11-10 06:38:10,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:38:11,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:38:11,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:38:11,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:38:11,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:38:11,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2024-11-10 06:38:12,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:38:12,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:38:12,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2024-11-10 06:38:12,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed80ae3e0/083cf25af1d54f478ec47fa36618fbb5/FLAG55832a465 [2024-11-10 06:38:13,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed80ae3e0/083cf25af1d54f478ec47fa36618fbb5 [2024-11-10 06:38:13,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:38:13,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:38:13,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:38:13,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:38:13,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:38:13,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133bcf43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13, skipping insertion in model container [2024-11-10 06:38:13,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:38:13,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2024-11-10 06:38:13,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:38:13,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:38:13,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2024-11-10 06:38:13,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:38:13,595 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:38:13,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13 WrapperNode [2024-11-10 06:38:13,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:38:13,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:38:13,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:38:13,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:38:13,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,655 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-10 06:38:13,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:38:13,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:38:13,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:38:13,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:38:13,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:38:13,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:38:13,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:38:13,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:38:13,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:38:13,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (1/1) ... [2024-11-10 06:38:13,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:38:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:38:13,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:38:13,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:38:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:38:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:38:13,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:38:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:38:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:38:13,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:38:13,909 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:38:13,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:38:14,272 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1; [2024-11-10 06:38:14,306 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:38:14,307 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:38:14,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:38:14,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:38:14,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:38:14 BoogieIcfgContainer [2024-11-10 06:38:14,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:38:14,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:38:14,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:38:14,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:38:14,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:38:13" (1/3) ... [2024-11-10 06:38:14,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5f7fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:38:14, skipping insertion in model container [2024-11-10 06:38:14,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:13" (2/3) ... [2024-11-10 06:38:14,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5f7fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:38:14, skipping insertion in model container [2024-11-10 06:38:14,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:38:14" (3/3) ... [2024-11-10 06:38:14,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-98.i [2024-11-10 06:38:14,353 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:38:14,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:38:14,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:38:14,430 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;@41b4a1e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:38:14,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:38:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 06:38:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:38:14,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:14,455 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:38:14,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 778448215, now seen corresponding path program 1 times [2024-11-10 06:38:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177362999] [2024-11-10 06:38:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:38:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 06:38:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:38:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:38:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:38:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:38:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:38:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:38:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:38:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:38:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:38:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:38:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 06:38:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:38:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 06:38:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 06:38:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177362999] [2024-11-10 06:38:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177362999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:38:15,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767689711] [2024-11-10 06:38:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:15,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:38:15,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:38:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:38:15,038 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 06:38:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:15,084 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2024-11-10 06:38:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:38:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-11-10 06:38:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:15,094 INFO L225 Difference]: With dead ends: 146 [2024-11-10 06:38:15,094 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 06:38:15,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:38:15,104 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:15,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:38:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 06:38:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 06:38:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 06:38:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 06:38:15,175 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 155 [2024-11-10 06:38:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:15,176 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 06:38:15,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 06:38:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 06:38:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:38:15,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:15,184 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:38:15,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:38:15,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:15,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -74423205, now seen corresponding path program 1 times [2024-11-10 06:38:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121521873] [2024-11-10 06:38:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:38:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 06:38:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:38:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:38:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:38:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:38:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:38:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:38:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:38:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:38:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:38:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:38:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 06:38:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:38:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 06:38:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 06:38:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121521873] [2024-11-10 06:38:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121521873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:38:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286023014] [2024-11-10 06:38:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:16,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:38:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:38:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:38:16,077 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:16,240 INFO L93 Difference]: Finished difference Result 211 states and 320 transitions. [2024-11-10 06:38:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:38:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 06:38:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:16,245 INFO L225 Difference]: With dead ends: 211 [2024-11-10 06:38:16,245 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 06:38:16,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:38:16,251 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:16,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 389 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:38:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 06:38:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-10 06:38:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 06:38:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-10 06:38:16,295 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 155 [2024-11-10 06:38:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:16,296 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-10 06:38:16,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-10 06:38:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:38:16,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:16,300 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:38:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:38:16,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:16,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2117062202, now seen corresponding path program 1 times [2024-11-10 06:38:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238737913] [2024-11-10 06:38:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:38:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 06:38:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:38:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:38:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:38:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:38:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:38:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:38:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:38:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:38:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:38:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:38:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 06:38:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:38:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 06:38:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 06:38:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238737913] [2024-11-10 06:38:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238737913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:17,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:38:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300768525] [2024-11-10 06:38:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:17,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:38:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:38:17,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:38:17,130 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:17,400 INFO L93 Difference]: Finished difference Result 285 states and 434 transitions. [2024-11-10 06:38:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:38:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 06:38:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:17,406 INFO L225 Difference]: With dead ends: 285 [2024-11-10 06:38:17,407 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 06:38:17,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:38:17,412 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:17,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 235 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:38:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 06:38:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2024-11-10 06:38:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 06:38:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2024-11-10 06:38:17,448 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 155 [2024-11-10 06:38:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2024-11-10 06:38:17,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2024-11-10 06:38:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:38:17,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:17,455 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:38:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:38:17,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1823659195, now seen corresponding path program 1 times [2024-11-10 06:38:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794208224] [2024-11-10 06:38:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:38:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 06:38:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:38:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:38:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:38:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:38:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:38:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:38:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:38:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:38:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:38:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:38:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 06:38:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:38:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 06:38:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 06:38:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794208224] [2024-11-10 06:38:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794208224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 06:38:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631728572] [2024-11-10 06:38:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 06:38:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 06:38:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:38:18,885 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:19,803 INFO L93 Difference]: Finished difference Result 443 states and 667 transitions. [2024-11-10 06:38:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:38:19,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 06:38:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:19,807 INFO L225 Difference]: With dead ends: 443 [2024-11-10 06:38:19,808 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 06:38:19,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:38:19,809 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 309 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:19,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 418 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 06:38:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 06:38:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 249. [2024-11-10 06:38:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 153 states have internal predecessors, (194), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 06:38:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 378 transitions. [2024-11-10 06:38:19,865 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 378 transitions. Word has length 155 [2024-11-10 06:38:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 378 transitions. [2024-11-10 06:38:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 06:38:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 378 transitions. [2024-11-10 06:38:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:38:19,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:19,868 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:38:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:38:19,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -728497766, now seen corresponding path program 1 times [2024-11-10 06:38:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316110424] [2024-11-10 06:38:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat