./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-cn_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-28.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 cd55918a0cfa8c59300397fe9f60040e5be3fed8c81d6efb35e5e42b738b1c70 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:13:41,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:13:41,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:13:41,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:13:41,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:13:41,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:13:42,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:13:42,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:13:42,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:13:42,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:13:42,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:13:42,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:13:42,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:13:42,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:13:42,003 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:13:42,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:13:42,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:13:42,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:13:42,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:13:42,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:13:42,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:13:42,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:13:42,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:13:42,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:13:42,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:13:42,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:13:42,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:13:42,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:13:42,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:13:42,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:13:42,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:13:42,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:13:42,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:13:42,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:13:42,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:13:42,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:13:42,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:13:42,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:13:42,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:13:42,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:13:42,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:13:42,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:13:42,014 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 -> cd55918a0cfa8c59300397fe9f60040e5be3fed8c81d6efb35e5e42b738b1c70 [2024-10-14 09:13:42,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:13:42,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:13:42,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:13:42,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:13:42,262 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:13:42,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-28.i [2024-10-14 09:13:43,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:13:43,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:13:43,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-28.i [2024-10-14 09:13:43,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6127b9d32/8d56c8c31334410ea587e14c652ac456/FLAG6d72778d6 [2024-10-14 09:13:44,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6127b9d32/8d56c8c31334410ea587e14c652ac456 [2024-10-14 09:13:44,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:13:44,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:13:44,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:13:44,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:13:44,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:13:44,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638292cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44, skipping insertion in model container [2024-10-14 09:13:44,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:13:44,391 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-cn_file-28.i[919,932] [2024-10-14 09:13:44,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:13:44,497 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:13:44,516 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-cn_file-28.i[919,932] [2024-10-14 09:13:44,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:13:44,624 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:13:44,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44 WrapperNode [2024-10-14 09:13:44,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:13:44,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:13:44,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:13:44,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:13:44,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,689 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2024-10-14 09:13:44,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:13:44,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:13:44,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:13:44,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:13:44,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,746 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-14 09:13:44,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:13:44,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:13:44,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:13:44,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:13:44,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (1/1) ... [2024-10-14 09:13:44,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:13:44,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:13:44,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:13:44,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:13:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:13:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:13:44,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:13:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:13:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:13:44,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:13:44,945 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:13:44,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:13:45,330 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 09:13:45,332 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:13:45,373 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:13:45,373 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:13:45,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:45 BoogieIcfgContainer [2024-10-14 09:13:45,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:13:45,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:13:45,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:13:45,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:13:45,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:13:44" (1/3) ... [2024-10-14 09:13:45,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d64cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:45, skipping insertion in model container [2024-10-14 09:13:45,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:44" (2/3) ... [2024-10-14 09:13:45,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d64cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:45, skipping insertion in model container [2024-10-14 09:13:45,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:45" (3/3) ... [2024-10-14 09:13:45,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-28.i [2024-10-14 09:13:45,397 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:13:45,398 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:13:45,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:13:45,473 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;@189960c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:13:45,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:13:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:13:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:13:45,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:13:45,493 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:13:45,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:13:45,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:13:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1149944877, now seen corresponding path program 1 times [2024-10-14 09:13:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:13:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281313064] [2024-10-14 09:13:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:13:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:13:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:13:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:13:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:13:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:13:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:13:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:13:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:13:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:13:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:13:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:13:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:13:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:13:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:13:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:13:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:13:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:13:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:13:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:13:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:13:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:13:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:13:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:13:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:13:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:13:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:13:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:13:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:13:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:13:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:13:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 09:13:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:13:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 09:13:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 09:13:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 09:13:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 09:13:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:13:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:13:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:13:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281313064] [2024-10-14 09:13:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281313064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:13:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:13:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:13:46,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611959038] [2024-10-14 09:13:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:13:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:13:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:13:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:13:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:13:46,125 INFO L87 Difference]: Start difference. First operand has 107 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:13:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:13:46,168 INFO L93 Difference]: Finished difference Result 211 states and 375 transitions. [2024-10-14 09:13:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:13:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 222 [2024-10-14 09:13:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:13:46,179 INFO L225 Difference]: With dead ends: 211 [2024-10-14 09:13:46,180 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 09:13:46,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-14 09:13:46,186 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:13:46,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:13:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 09:13:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 09:13:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:13:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 166 transitions. [2024-10-14 09:13:46,232 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 166 transitions. Word has length 222 [2024-10-14 09:13:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:13:46,233 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 166 transitions. [2024-10-14 09:13:46,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:13:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2024-10-14 09:13:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:13:46,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:13:46,238 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:13:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:13:46,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:13:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:13:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1429647437, now seen corresponding path program 1 times [2024-10-14 09:13:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:13:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139014722] [2024-10-14 09:13:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:13:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:13:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:14:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:14:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:14:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:14:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:14:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:14:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:14:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:14:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:14:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:14:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:14:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:14:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:14:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:14:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:14:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:14:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:14:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:14:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:14:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:14:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:14:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:14:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:14:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:14:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:14:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:14:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:14:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:14:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:14:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 09:14:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:14:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 09:14:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 09:14:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 09:14:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 09:14:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:14:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:14:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139014722] [2024-10-14 09:14:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139014722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:14:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:14:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 09:14:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562660576] [2024-10-14 09:14:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:14:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 09:14:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:14:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 09:14:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 09:14:15,437 INFO L87 Difference]: Start difference. First operand 105 states and 166 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:14:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:14:17,860 INFO L93 Difference]: Finished difference Result 465 states and 734 transitions. [2024-10-14 09:14:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 09:14:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:14:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:14:17,864 INFO L225 Difference]: With dead ends: 465 [2024-10-14 09:14:17,864 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 09:14:17,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 09:14:17,866 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 570 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:14:17,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 923 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 09:14:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 09:14:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 236. [2024-10-14 09:14:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 163 states have (on average 1.460122699386503) internal successors, (238), 163 states have internal predecessors, (238), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:14:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 378 transitions. [2024-10-14 09:14:17,915 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 378 transitions. Word has length 222 [2024-10-14 09:14:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:14:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 378 transitions. [2024-10-14 09:14:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:14:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 378 transitions. [2024-10-14 09:14:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:14:17,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:14:17,924 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:14:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:14:17,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:14:17,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:14:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1276971957, now seen corresponding path program 1 times [2024-10-14 09:14:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:14:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729560369] [2024-10-14 09:14:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:14:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:14:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:14:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:14:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:14:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:14:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:14:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:14:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:14:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:14:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:14:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:14:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:14:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:14:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:14:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:14:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:14:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:14:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:14:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:14:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:14:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:14:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:14:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:14:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:14:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:14:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:14:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:14:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:14:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:14:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:14:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 09:14:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:14:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 09:14:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 09:14:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 09:14:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 09:14:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:14:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:14:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729560369] [2024-10-14 09:14:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729560369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:14:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:14:18,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:14:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532794222] [2024-10-14 09:14:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:14:18,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:14:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:14:18,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:14:18,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:14:18,203 INFO L87 Difference]: Start difference. First operand 236 states and 378 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:14:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:14:18,471 INFO L93 Difference]: Finished difference Result 641 states and 1024 transitions. [2024-10-14 09:14:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:14:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:14:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:14:18,475 INFO L225 Difference]: With dead ends: 641 [2024-10-14 09:14:18,475 INFO L226 Difference]: Without dead ends: 406 [2024-10-14 09:14:18,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:14:18,478 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 411 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:14:18,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 668 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:14:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-14 09:14:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 259. [2024-10-14 09:14:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 186 states have (on average 1.4838709677419355) internal successors, (276), 186 states have internal predecessors, (276), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:14:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 416 transitions. [2024-10-14 09:14:18,505 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 416 transitions. Word has length 222 [2024-10-14 09:14:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:14:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 416 transitions. [2024-10-14 09:14:18,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:14:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 416 transitions. [2024-10-14 09:14:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:14:18,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:14:18,508 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:14:18,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:14:18,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:14:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:14:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1006945611, now seen corresponding path program 1 times [2024-10-14 09:14:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:14:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011609234] [2024-10-14 09:14:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:14:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:14:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:14:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:14:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:14:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:14:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:14:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:14:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:14:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:14:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:14:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:14:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:14:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:14:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:14:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:14:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:14:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:14:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:14:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:14:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:14:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:14:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:14:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:14:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:14:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:14:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:14:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:14:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:14:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:14:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:14:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 09:14:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:14:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 09:14:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 09:14:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 09:14:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 09:14:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:14:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:14:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:14:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011609234] [2024-10-14 09:14:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011609234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:14:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:14:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 09:14:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159787423] [2024-10-14 09:14:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:14:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 09:14:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:14:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 09:14:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 09:14:56,846 INFO L87 Difference]: Start difference. First operand 259 states and 416 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:15:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:00,838 INFO L93 Difference]: Finished difference Result 665 states and 1057 transitions. [2024-10-14 09:15:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 09:15:00,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:15:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:00,842 INFO L225 Difference]: With dead ends: 665 [2024-10-14 09:15:00,842 INFO L226 Difference]: Without dead ends: 407 [2024-10-14 09:15:00,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:15:00,844 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 411 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:00,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1271 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 09:15:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-14 09:15:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 259. [2024-10-14 09:15:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 186 states have (on average 1.4838709677419355) internal successors, (276), 186 states have internal predecessors, (276), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:15:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 416 transitions. [2024-10-14 09:15:00,864 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 416 transitions. Word has length 222 [2024-10-14 09:15:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:00,865 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 416 transitions. [2024-10-14 09:15:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:15:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 416 transitions. [2024-10-14 09:15:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:15:00,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:00,869 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:15:00,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1059881525, now seen corresponding path program 1 times [2024-10-14 09:15:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603395672] [2024-10-14 09:15:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:15:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:15:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:15:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:15:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:15:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:15:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:15:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:15:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:15:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:15:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:15:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:15:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:15:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:15:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:15:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:15:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 09:15:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:15:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 09:15:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 09:15:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 09:15:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 09:15:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:15:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603395672] [2024-10-14 09:15:01,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603395672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:01,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:15:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77979197] [2024-10-14 09:15:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:01,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:15:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:15:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:15:01,119 INFO L87 Difference]: Start difference. First operand 259 states and 416 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:15:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:01,313 INFO L93 Difference]: Finished difference Result 841 states and 1349 transitions. [2024-10-14 09:15:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:15:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:15:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:01,321 INFO L225 Difference]: With dead ends: 841 [2024-10-14 09:15:01,321 INFO L226 Difference]: Without dead ends: 583 [2024-10-14 09:15:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:15:01,324 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 165 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:01,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 678 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:15:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-14 09:15:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 484. [2024-10-14 09:15:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 339 states have (on average 1.4601769911504425) internal successors, (495), 339 states have internal predecessors, (495), 140 states have call successors, (140), 4 states have call predecessors, (140), 4 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-14 09:15:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 775 transitions. [2024-10-14 09:15:01,444 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 775 transitions. Word has length 222 [2024-10-14 09:15:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:01,444 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 775 transitions. [2024-10-14 09:15:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:15:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 775 transitions. [2024-10-14 09:15:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-14 09:15:01,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:01,446 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:15:01,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 369612702, now seen corresponding path program 1 times [2024-10-14 09:15:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522679920] [2024-10-14 09:15:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat