./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-pr-ci_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-pr-ci_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c554204f9340f445d5caf6fceb919bd7ca7d94cde437779a40eaa60e7857908 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:37:42,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:37:42,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:37:42,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:37:42,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:37:42,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:37:42,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:37:42,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:37:42,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:37:42,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:37:42,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:37:42,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:37:42,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:37:42,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:37:42,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:37:42,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:37:42,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:37:42,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:37:42,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:37:42,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:37:42,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:37:42,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:37:42,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:37:42,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:37:42,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:37:42,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:37:42,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:37:42,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:37:42,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:37:42,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:37:42,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:37:42,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:37:42,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:37:42,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:37:42,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:37:42,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:37:42,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:37:42,233 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c554204f9340f445d5caf6fceb919bd7ca7d94cde437779a40eaa60e7857908 [2024-11-20 04:37:42,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:37:42,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:37:42,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:37:42,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:37:42,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:37:42,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-20 04:37:44,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:37:44,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:37:44,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-20 04:37:44,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f6b4d8b/ba020e57088946a6991913ab8e1288f6/FLAG8a8099df1 [2024-11-20 04:37:44,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f6b4d8b/ba020e57088946a6991913ab8e1288f6 [2024-11-20 04:37:44,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:37:44,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:37:44,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:37:44,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:37:44,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:37:44,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a78dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44, skipping insertion in model container [2024-11-20 04:37:44,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:37:44,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i[919,932] [2024-11-20 04:37:44,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:37:44,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:37:44,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i[919,932] [2024-11-20 04:37:44,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:37:44,688 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:37:44,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44 WrapperNode [2024-11-20 04:37:44,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:37:44,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:37:44,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:37:44,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:37:44,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,776 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-20 04:37:44,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:37:44,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:37:44,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:37:44,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:37:44,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:37:44,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:37:44,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:37:44,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:37:44,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:37:44,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (1/1) ... [2024-11-20 04:37:44,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:37:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:37:44,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:37:44,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:37:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:37:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:37:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:37:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:37:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:37:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:37:45,072 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:37:45,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:37:45,530 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:37:45,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:37:45,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:37:45,552 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:37:45,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:37:45 BoogieIcfgContainer [2024-11-20 04:37:45,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:37:45,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:37:45,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:37:45,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:37:45,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:37:44" (1/3) ... [2024-11-20 04:37:45,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c1bf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:37:45, skipping insertion in model container [2024-11-20 04:37:45,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:37:44" (2/3) ... [2024-11-20 04:37:45,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c1bf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:37:45, skipping insertion in model container [2024-11-20 04:37:45,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:37:45" (3/3) ... [2024-11-20 04:37:45,564 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-59.i [2024-11-20 04:37:45,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:37:45,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:37:45,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:37:45,671 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;@52e8a2f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:37:45,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:37:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 04:37:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 04:37:45,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:45,692 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:45,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -49966647, now seen corresponding path program 1 times [2024-11-20 04:37:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202359855] [2024-11-20 04:37:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 04:37:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202359855] [2024-11-20 04:37:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202359855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:37:46,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:37:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:37:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906850352] [2024-11-20 04:37:46,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:37:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:37:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:37:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:37:46,221 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 04:37:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:46,251 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2024-11-20 04:37:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:37:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2024-11-20 04:37:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:46,262 INFO L225 Difference]: With dead ends: 159 [2024-11-20 04:37:46,262 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 04:37:46,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:37:46,269 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:46,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:37:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 04:37:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 04:37:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 04:37:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-20 04:37:46,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 138 [2024-11-20 04:37:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-20 04:37:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 04:37:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-20 04:37:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 04:37:46,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:46,346 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:37:46,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:46,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1232842543, now seen corresponding path program 1 times [2024-11-20 04:37:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439409297] [2024-11-20 04:37:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 04:37:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:46,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439409297] [2024-11-20 04:37:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439409297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:37:46,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:37:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:37:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390088016] [2024-11-20 04:37:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:37:46,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:37:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:37:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:37:46,861 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:46,953 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2024-11-20 04:37:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:37:46,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-20 04:37:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:46,957 INFO L225 Difference]: With dead ends: 155 [2024-11-20 04:37:46,957 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 04:37:46,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:37:46,962 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:46,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:37:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 04:37:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 04:37:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 04:37:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-20 04:37:46,979 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 138 [2024-11-20 04:37:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-20 04:37:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-20 04:37:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 04:37:46,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:46,986 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:37:46,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash -552784173, now seen corresponding path program 1 times [2024-11-20 04:37:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516818512] [2024-11-20 04:37:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 04:37:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516818512] [2024-11-20 04:37:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516818512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:37:47,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:37:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:37:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342321739] [2024-11-20 04:37:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:37:47,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:37:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:37:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:37:47,441 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:47,611 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2024-11-20 04:37:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:37:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-20 04:37:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:47,618 INFO L225 Difference]: With dead ends: 232 [2024-11-20 04:37:47,618 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 04:37:47,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:37:47,620 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 107 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:47,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 344 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:37:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 04:37:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 117. [2024-11-20 04:37:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 74 states have internal predecessors, (97), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 04:37:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2024-11-20 04:37:47,657 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 138 [2024-11-20 04:37:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:47,659 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2024-11-20 04:37:47,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2024-11-20 04:37:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 04:37:47,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:47,665 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:47,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:37:47,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1165230544, now seen corresponding path program 1 times [2024-11-20 04:37:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344025935] [2024-11-20 04:37:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:47,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 04:37:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344025935] [2024-11-20 04:37:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344025935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:37:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:37:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:37:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999353368] [2024-11-20 04:37:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:37:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:37:48,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:37:48,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:37:48,109 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:48,291 INFO L93 Difference]: Finished difference Result 279 states and 423 transitions. [2024-11-20 04:37:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:37:48,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-20 04:37:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:48,294 INFO L225 Difference]: With dead ends: 279 [2024-11-20 04:37:48,294 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 04:37:48,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:37:48,300 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 123 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:48,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 342 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:37:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 04:37:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2024-11-20 04:37:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:37:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 291 transitions. [2024-11-20 04:37:48,327 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 291 transitions. Word has length 139 [2024-11-20 04:37:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:48,328 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 291 transitions. [2024-11-20 04:37:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 291 transitions. [2024-11-20 04:37:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 04:37:48,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:48,330 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:48,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:37:48,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1381184424, now seen corresponding path program 1 times [2024-11-20 04:37:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840291274] [2024-11-20 04:37:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 04:37:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840291274] [2024-11-20 04:37:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840291274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:37:48,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:37:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 04:37:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514598703] [2024-11-20 04:37:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:37:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:37:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:37:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 04:37:48,929 INFO L87 Difference]: Start difference. First operand 191 states and 291 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:49,277 INFO L93 Difference]: Finished difference Result 431 states and 652 transitions. [2024-11-20 04:37:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:37:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-20 04:37:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:49,281 INFO L225 Difference]: With dead ends: 431 [2024-11-20 04:37:49,281 INFO L226 Difference]: Without dead ends: 281 [2024-11-20 04:37:49,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:37:49,283 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 154 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:49,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 441 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:37:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-20 04:37:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 226. [2024-11-20 04:37:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 161 states have internal predecessors, (228), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:37:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 348 transitions. [2024-11-20 04:37:49,334 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 348 transitions. Word has length 140 [2024-11-20 04:37:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:49,335 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 348 transitions. [2024-11-20 04:37:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 04:37:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 348 transitions. [2024-11-20 04:37:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 04:37:49,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:49,337 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:37:49,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash -424253910, now seen corresponding path program 1 times [2024-11-20 04:37:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095801715] [2024-11-20 04:37:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:37:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:37:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:37:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:37:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:37:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:37:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:37:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:37:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:37:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:37:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:37:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:37:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:37:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:37:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:37:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:37:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:37:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:37:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:37:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:37:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 04:37:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:49,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095801715] [2024-11-20 04:37:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095801715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:37:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390996262] [2024-11-20 04:37:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:37:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:37:49,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:37:49,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:37:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:49,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 04:37:49,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:37:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-20 04:37:50,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:37:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 04:37:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390996262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:37:50,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:37:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 10 [2024-11-20 04:37:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126706254] [2024-11-20 04:37:50,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:37:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 04:37:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 04:37:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:37:50,351 INFO L87 Difference]: Start difference. First operand 226 states and 348 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-20 04:37:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:51,248 INFO L93 Difference]: Finished difference Result 673 states and 985 transitions. [2024-11-20 04:37:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 04:37:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 140 [2024-11-20 04:37:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:51,253 INFO L225 Difference]: With dead ends: 673 [2024-11-20 04:37:51,253 INFO L226 Difference]: Without dead ends: 506 [2024-11-20 04:37:51,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=806, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 04:37:51,256 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 523 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:51,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 260 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 04:37:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-20 04:37:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 367. [2024-11-20 04:37:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 267 states have (on average 1.2134831460674158) internal successors, (324), 269 states have internal predecessors, (324), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 04:37:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 492 transitions. [2024-11-20 04:37:51,318 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 492 transitions. Word has length 140 [2024-11-20 04:37:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 492 transitions. [2024-11-20 04:37:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-20 04:37:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 492 transitions. [2024-11-20 04:37:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 04:37:51,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:51,321 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:51,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:37:51,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 04:37:51,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:51,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1822862007, now seen corresponding path program 1 times [2024-11-20 04:37:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569005778] [2024-11-20 04:37:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:37:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014175833] [2024-11-20 04:37:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:37:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:37:51,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:37:51,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:37:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:51,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 04:37:51,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:37:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 159 proven. 51 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-20 04:37:52,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:37:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 04:37:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:37:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569005778] [2024-11-20 04:37:52,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:37:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014175833] [2024-11-20 04:37:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014175833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:37:52,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:37:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2024-11-20 04:37:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921665526] [2024-11-20 04:37:52,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:37:52,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 04:37:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:37:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 04:37:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 04:37:52,465 INFO L87 Difference]: Start difference. First operand 367 states and 492 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-20 04:37:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:37:52,923 INFO L93 Difference]: Finished difference Result 731 states and 970 transitions. [2024-11-20 04:37:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 04:37:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 145 [2024-11-20 04:37:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:37:52,930 INFO L225 Difference]: With dead ends: 731 [2024-11-20 04:37:52,930 INFO L226 Difference]: Without dead ends: 405 [2024-11-20 04:37:52,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:37:52,932 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:37:52,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 327 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:37:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-20 04:37:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2024-11-20 04:37:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 279 states have (on average 1.189964157706093) internal successors, (332), 281 states have internal predecessors, (332), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 04:37:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 500 transitions. [2024-11-20 04:37:52,974 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 500 transitions. Word has length 145 [2024-11-20 04:37:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:37:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 500 transitions. [2024-11-20 04:37:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-20 04:37:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 500 transitions. [2024-11-20 04:37:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 04:37:52,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:37:52,977 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:37:52,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:37:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 04:37:53,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:37:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:37:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1848242774, now seen corresponding path program 1 times [2024-11-20 04:37:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:37:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649649056] [2024-11-20 04:37:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:37:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:37:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771845994] [2024-11-20 04:37:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:37:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:37:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:37:53,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:37:53,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:37:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:37:53,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 04:37:53,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:37:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 199 proven. 135 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-20 04:37:54,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:38:27,594 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 04:38:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:38:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649649056] [2024-11-20 04:38:46,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:38:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771845994] [2024-11-20 04:38:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771845994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:38:46,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:38:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-20 04:38:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396652020] [2024-11-20 04:38:46,476 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 04:38:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 04:38:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:38:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 04:38:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-20 04:38:46,479 INFO L87 Difference]: Start difference. First operand 383 states and 500 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 04:38:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:38:47,447 INFO L93 Difference]: Finished difference Result 737 states and 952 transitions. [2024-11-20 04:38:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 04:38:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 146 [2024-11-20 04:38:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:38:47,453 INFO L225 Difference]: With dead ends: 737 [2024-11-20 04:38:47,454 INFO L226 Difference]: Without dead ends: 411 [2024-11-20 04:38:47,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-20 04:38:47,457 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 70 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 04:38:47,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 484 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 04:38:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-20 04:38:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 395. [2024-11-20 04:38:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 288 states have (on average 1.1770833333333333) internal successors, (339), 290 states have internal predecessors, (339), 84 states have call successors, (84), 22 states have call predecessors, (84), 22 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 04:38:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 507 transitions. [2024-11-20 04:38:47,506 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 507 transitions. Word has length 146 [2024-11-20 04:38:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:38:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 507 transitions. [2024-11-20 04:38:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 04:38:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 507 transitions. [2024-11-20 04:38:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 04:38:47,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:38:47,509 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:38:47,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:38:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:38:47,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:38:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:38:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash -507753492, now seen corresponding path program 1 times [2024-11-20 04:38:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:38:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933762190] [2024-11-20 04:38:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:38:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:38:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:38:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286277745] [2024-11-20 04:38:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:38:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:38:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:38:47,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:38:47,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 04:38:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:38:47,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 04:38:47,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:38:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-20 04:38:49,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:38:59,689 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)