./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_variablewrapping_wrapper-sp_file-39.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_variablewrapping_wrapper-sp_file-39.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 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:07:09,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:07:09,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:07:09,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:07:09,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:07:09,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:07:09,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:07:09,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:07:09,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:07:09,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:07:09,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:07:09,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:07:09,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:07:09,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:07:09,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:07:09,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:07:09,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:07:09,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:07:09,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:07:09,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:07:09,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:07:09,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:07:09,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:07:09,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:07:09,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:07:09,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:07:09,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:07:09,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:09,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:07:09,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:07:09,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:07:09,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:07:09,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:07:09,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:07:09,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:07:09,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:07:09,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:07:09,334 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 -> 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 [2024-11-20 09:07:09,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:07:09,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:07:09,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:07:09,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:07:09,561 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:07:09,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-20 09:07:10,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:07:11,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:07:11,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-20 09:07:11,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114cb19f1/bb4b9a54c8574a49bf755d9d107fa42e/FLAG826b43c97 [2024-11-20 09:07:11,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114cb19f1/bb4b9a54c8574a49bf755d9d107fa42e [2024-11-20 09:07:11,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:07:11,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:07:11,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:11,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:07:11,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:07:11,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3657aa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11, skipping insertion in model container [2024-11-20 09:07:11,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:07:11,590 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_variablewrapping_wrapper-sp_file-39.i[917,930] [2024-11-20 09:07:11,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:11,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:07:11,685 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_variablewrapping_wrapper-sp_file-39.i[917,930] [2024-11-20 09:07:11,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:11,736 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:07:11,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11 WrapperNode [2024-11-20 09:07:11,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:11,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:11,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:07:11,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:07:11,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,801 INFO L138 Inliner]: procedures = 30, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2024-11-20 09:07:11,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:11,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:07:11,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:07:11,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:07:11,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,826 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:07:11,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:07:11,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:07:11,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:07:11,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:07:11,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (1/1) ... [2024-11-20 09:07:11,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:07:11,903 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 09:07:11,905 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 09:07:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:07:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:07:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:07:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:07:12,037 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:07:12,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:07:12,531 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-20 09:07:12,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:07:12,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:07:12,551 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:07:12,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:12 BoogieIcfgContainer [2024-11-20 09:07:12,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:07:12,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:07:12,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:07:12,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:07:12,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:07:11" (1/3) ... [2024-11-20 09:07:12,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696dc591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:12, skipping insertion in model container [2024-11-20 09:07:12,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:11" (2/3) ... [2024-11-20 09:07:12,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696dc591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:12, skipping insertion in model container [2024-11-20 09:07:12,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:12" (3/3) ... [2024-11-20 09:07:12,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-20 09:07:12,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:07:12,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:07:12,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:07:12,639 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;@738db3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:07:12,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:07:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:07:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:07:12,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:12,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:12,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:12,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 276579875, now seen corresponding path program 1 times [2024-11-20 09:07:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765750940] [2024-11-20 09:07:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:07:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:07:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:07:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:07:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:07:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765750940] [2024-11-20 09:07:13,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765750940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:13,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:13,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:07:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101111874] [2024-11-20 09:07:13,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:07:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:07:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:07:13,117 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:13,140 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-20 09:07:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:07:13,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-20 09:07:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:13,148 INFO L225 Difference]: With dead ends: 233 [2024-11-20 09:07:13,149 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 09:07:13,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 09:07:13,154 INFO L432 NwaCegarLoop]: 170 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, 170 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 09:07:13,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 09:07:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 09:07:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:07:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-20 09:07:13,204 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-20 09:07:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:13,205 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-20 09:07:13,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-20 09:07:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:07:13,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:13,208 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:13,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:07:13,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash 534061159, now seen corresponding path program 1 times [2024-11-20 09:07:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726121767] [2024-11-20 09:07:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:07:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:07:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:07:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:07:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:07:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726121767] [2024-11-20 09:07:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726121767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:07:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018281633] [2024-11-20 09:07:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:13,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:07:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:07:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:07:13,560 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:13,601 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2024-11-20 09:07:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:07:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-20 09:07:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:13,603 INFO L225 Difference]: With dead ends: 231 [2024-11-20 09:07:13,603 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 09:07:13,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:07:13,605 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:13,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 09:07:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 09:07:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:07:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-20 09:07:13,614 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 128 [2024-11-20 09:07:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:13,616 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-20 09:07:13,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-20 09:07:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:07:13,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:13,618 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:13,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:07:13,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:13,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash -726856091, now seen corresponding path program 1 times [2024-11-20 09:07:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308808131] [2024-11-20 09:07:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:13,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:07:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:07:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:07:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:07:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:07:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:16,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308808131] [2024-11-20 09:07:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308808131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:07:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520759409] [2024-11-20 09:07:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:07:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:07:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:07:16,221 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:16,938 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2024-11-20 09:07:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:07:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-20 09:07:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:16,941 INFO L225 Difference]: With dead ends: 305 [2024-11-20 09:07:16,942 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 09:07:16,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:07:16,943 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 392 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:16,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 322 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:07:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 09:07:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-20 09:07:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.420731707317073) internal successors, (233), 165 states have internal predecessors, (233), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:07:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 273 transitions. [2024-11-20 09:07:16,961 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 273 transitions. Word has length 128 [2024-11-20 09:07:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:16,961 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 273 transitions. [2024-11-20 09:07:16,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:07:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 273 transitions. [2024-11-20 09:07:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:07:16,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:16,963 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:16,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:07:16,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:16,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1406914461, now seen corresponding path program 1 times [2024-11-20 09:07:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:16,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502484640] [2024-11-20 09:07:16,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:07:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:07:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:07:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:07:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:07:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502484640] [2024-11-20 09:07:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502484640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 09:07:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140705002] [2024-11-20 09:07:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:22,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 09:07:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:22,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 09:07:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:07:22,347 INFO L87 Difference]: Start difference. First operand 187 states and 273 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-20 09:07:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:25,383 INFO L93 Difference]: Finished difference Result 466 states and 679 transitions. [2024-11-20 09:07:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 09:07:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-20 09:07:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:25,386 INFO L225 Difference]: With dead ends: 466 [2024-11-20 09:07:25,389 INFO L226 Difference]: Without dead ends: 282 [2024-11-20 09:07:25,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-11-20 09:07:25,392 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 506 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:25,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1238 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 09:07:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-20 09:07:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 195. [2024-11-20 09:07:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 173 states have internal predecessors, (243), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:07:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-20 09:07:25,420 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 128 [2024-11-20 09:07:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-20 09:07:25,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-20 09:07:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-20 09:07:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:07:25,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:25,422 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:25,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:07:25,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:25,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1979763303, now seen corresponding path program 1 times [2024-11-20 09:07:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965578609] [2024-11-20 09:07:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:07:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:07:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:07:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:07:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 09:07:30,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965578609] [2024-11-20 09:07:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965578609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:07:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165482884] [2024-11-20 09:07:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:07:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:07:30,673 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 09:07:30,674 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 09:07:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:30,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-20 09:07:30,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:31,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:07:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-20 09:07:33,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2024-11-20 09:07:33,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2024-11-20 09:07:34,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-11-20 09:07:34,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-11-20 09:07:35,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-11-20 09:07:35,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-11-20 09:07:36,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-11-20 09:07:37,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 104 [2024-11-20 09:07:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:37,750 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-20 09:07:37,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 122 [2024-11-20 09:07:38,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,635 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-20 09:07:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 110 [2024-11-20 09:07:38,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:38,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:07:39,017 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-11-20 09:07:39,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 102 [2024-11-20 09:07:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 199 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-20 09:07:39,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:08:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165482884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:08:05,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 09:08:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2024-11-20 09:08:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633917195] [2024-11-20 09:08:05,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 09:08:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-20 09:08:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:08:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-20 09:08:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2813, Unknown=1, NotChecked=0, Total=3080 [2024-11-20 09:08:05,585 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 45 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 43 states have internal predecessors, (113), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-20 09:08:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:08:17,544 INFO L93 Difference]: Finished difference Result 548 states and 781 transitions. [2024-11-20 09:08:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-20 09:08:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 43 states have internal predecessors, (113), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 128 [2024-11-20 09:08:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:08:17,547 INFO L225 Difference]: With dead ends: 548 [2024-11-20 09:08:17,547 INFO L226 Difference]: Without dead ends: 356 [2024-11-20 09:08:17,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2181 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=1263, Invalid=7856, Unknown=1, NotChecked=0, Total=9120 [2024-11-20 09:08:17,550 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1182 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 4271 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 4374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:08:17,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 2450 Invalid, 4374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4271 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-20 09:08:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-20 09:08:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 236. [2024-11-20 09:08:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 208 states have (on average 1.3942307692307692) internal successors, (290), 209 states have internal predecessors, (290), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:08:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2024-11-20 09:08:17,575 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 128 [2024-11-20 09:08:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:08:17,575 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2024-11-20 09:08:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 43 states have internal predecessors, (113), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-20 09:08:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2024-11-20 09:08:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:08:17,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:08:17,577 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:17,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:08:17,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:08:17,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:08:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:08:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1299704933, now seen corresponding path program 1 times [2024-11-20 09:08:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:08:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769964290] [2024-11-20 09:08:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:08:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:08:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:08:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:08:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:08:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:08:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:08:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:08:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:08:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:08:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:08:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:08:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:08:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:08:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:08:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:08:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:08:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:08:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:08:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:08:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769964290] [2024-11-20 09:08:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769964290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:08:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:08:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:08:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667396063] [2024-11-20 09:08:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:08:19,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:08:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:08:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:08:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:08:19,527 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:08:21,076 INFO L93 Difference]: Finished difference Result 478 states and 664 transitions. [2024-11-20 09:08:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:08:21,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-20 09:08:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:08:21,078 INFO L225 Difference]: With dead ends: 478 [2024-11-20 09:08:21,078 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 09:08:21,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:08:21,079 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 322 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:08:21,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 812 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 09:08:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 09:08:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 185. [2024-11-20 09:08:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 163 states have (on average 1.392638036809816) internal successors, (227), 163 states have internal predecessors, (227), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:08:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2024-11-20 09:08:21,098 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 128 [2024-11-20 09:08:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:08:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2024-11-20 09:08:21,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2024-11-20 09:08:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 09:08:21,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:08:21,100 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:08:21,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:08:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:08:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1356234675, now seen corresponding path program 1 times [2024-11-20 09:08:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:08:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78998595] [2024-11-20 09:08:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:08:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:08:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:08:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:08:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:08:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:08:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:08:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:08:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:08:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:08:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:08:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:08:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:08:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:08:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:08:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:08:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:08:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:08:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:08:25,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:08:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78998595] [2024-11-20 09:08:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78998595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:08:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:08:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 09:08:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394908726] [2024-11-20 09:08:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:08:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 09:08:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:08:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 09:08:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:08:25,686 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:08:29,645 INFO L93 Difference]: Finished difference Result 458 states and 645 transitions. [2024-11-20 09:08:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 09:08:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-20 09:08:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:08:29,646 INFO L225 Difference]: With dead ends: 458 [2024-11-20 09:08:29,646 INFO L226 Difference]: Without dead ends: 276 [2024-11-20 09:08:29,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-11-20 09:08:29,649 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 389 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:08:29,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 945 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 09:08:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-20 09:08:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 179. [2024-11-20 09:08:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:08:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2024-11-20 09:08:29,671 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 129 [2024-11-20 09:08:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:08:29,672 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2024-11-20 09:08:29,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2024-11-20 09:08:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 09:08:29,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:08:29,673 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:08:29,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:08:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:08:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 150390094, now seen corresponding path program 1 times [2024-11-20 09:08:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:08:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693317773] [2024-11-20 09:08:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:08:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:08:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:08:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:08:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:08:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:08:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:08:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:08:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:08:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:08:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:08:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:08:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:08:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:08:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:08:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:08:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:08:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:08:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:08:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:08:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693317773] [2024-11-20 09:08:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693317773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:08:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:08:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:08:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439786188] [2024-11-20 09:08:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:08:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:08:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:08:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:08:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:08:30,305 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:08:30,943 INFO L93 Difference]: Finished difference Result 413 states and 582 transitions. [2024-11-20 09:08:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:08:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-11-20 09:08:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:08:30,944 INFO L225 Difference]: With dead ends: 413 [2024-11-20 09:08:30,945 INFO L226 Difference]: Without dead ends: 237 [2024-11-20 09:08:30,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:08:30,945 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 522 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:08:30,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 629 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:08:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-20 09:08:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2024-11-20 09:08:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.401098901098901) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 09:08:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2024-11-20 09:08:30,967 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 130 [2024-11-20 09:08:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:08:30,967 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2024-11-20 09:08:30,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 09:08:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2024-11-20 09:08:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 09:08:30,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:08:30,969 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:08:30,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:08:30,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:08:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 386474421, now seen corresponding path program 1 times [2024-11-20 09:08:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:08:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965386349] [2024-11-20 09:08:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:08:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:08:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat