/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:09:49,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:09:49,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:09:49,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:09:49,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:09:49,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:09:49,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:09:49,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:09:49,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:09:49,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:09:49,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:09:49,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:09:49,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:09:49,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:09:49,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:09:49,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:09:49,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:09:49,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:09:49,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:09:49,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:09:49,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:09:49,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:09:49,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:09:49,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:09:49,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:09:49,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:09:49,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:09:49,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:09:49,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:09:49,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:09:49,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:09:49,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:09:49,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:09:49,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:09:49,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:09:49,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:09:49,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:09:49,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:09:49,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:09:49,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:09:49,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:09:49,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:09:49,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:09:49,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:09:49,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:09:49,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:09:49,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:09:49,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:09:49,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:09:49,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:09:49,928 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:09:49,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:09:49,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:09:49,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:09:49,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:09:49,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:09:49,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:09:49,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:09:49,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:09:49,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:09:49,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:09:49,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:09:49,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:09:49,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:09:49,934 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:09:49,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:09:49,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:09:49,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:09:50,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:09:50,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:09:50,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:09:50,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:09:50,161 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:09:50,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label24.c [2022-01-10 00:09:50,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbbbf978/89f09cbc3f0841d1b8da332c2ad8bf7c/FLAGea5b97b35 [2022-01-10 00:09:50,892 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:09:50,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label24.c [2022-01-10 00:09:50,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbbbf978/89f09cbc3f0841d1b8da332c2ad8bf7c/FLAGea5b97b35 [2022-01-10 00:09:51,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbbbf978/89f09cbc3f0841d1b8da332c2ad8bf7c [2022-01-10 00:09:51,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:09:51,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:09:51,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:09:51,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:09:51,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:09:51,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:09:51" (1/1) ... [2022-01-10 00:09:51,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64376edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:51, skipping insertion in model container [2022-01-10 00:09:51,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:09:51" (1/1) ... [2022-01-10 00:09:51,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:09:51,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:09:51,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label24.c[4341,4354] [2022-01-10 00:09:52,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:09:52,400 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:09:52,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label24.c[4341,4354] [2022-01-10 00:09:52,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:09:52,935 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:09:52,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52 WrapperNode [2022-01-10 00:09:52,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:09:52,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:09:52,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:09:52,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:09:52,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,580 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5583 [2022-01-10 00:09:53,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:09:53,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:09:53,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:09:53,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:09:53,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:53,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:54,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:54,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:54,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:09:54,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:09:54,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:09:54,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:09:54,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (1/1) ... [2022-01-10 00:09:54,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:09:54,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:09:54,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:09:54,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:09:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:09:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:09:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:09:54,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:09:54,431 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:09:54,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:09:58,957 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:09:58,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:09:58,978 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:09:58,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:09:58 BoogieIcfgContainer [2022-01-10 00:09:58,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:09:58,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:09:58,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:09:58,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:09:58,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:09:51" (1/3) ... [2022-01-10 00:09:58,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c78a61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:09:58, skipping insertion in model container [2022-01-10 00:09:58,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:09:52" (2/3) ... [2022-01-10 00:09:58,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c78a61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:09:58, skipping insertion in model container [2022-01-10 00:09:58,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:09:58" (3/3) ... [2022-01-10 00:09:58,992 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem13_label24.c [2022-01-10 00:09:59,000 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:09:59,001 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:09:59,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:09:59,066 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:09:59,067 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:09:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:09:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:09:59,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:09:59,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:09:59,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:09:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:09:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2022-01-10 00:09:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:09:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828771252] [2022-01-10 00:09:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:09:59,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:09:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:09:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:09:59,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:09:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828771252] [2022-01-10 00:09:59,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828771252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:09:59,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:09:59,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:09:59,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846445761] [2022-01-10 00:09:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:09:59,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:09:59,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:09:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:09:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:09:59,409 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:03,580 INFO L93 Difference]: Finished difference Result 3082 states and 5689 transitions. [2022-01-10 00:10:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 00:10:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:03,612 INFO L225 Difference]: With dead ends: 3082 [2022-01-10 00:10:03,612 INFO L226 Difference]: Without dead ends: 1899 [2022-01-10 00:10:03,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:03,623 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 1010 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:03,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1010 Valid, 641 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-01-10 00:10:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-01-10 00:10:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2022-01-10 00:10:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2022-01-10 00:10:03,739 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 29 [2022-01-10 00:10:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:03,740 INFO L470 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2022-01-10 00:10:03,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2022-01-10 00:10:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-10 00:10:03,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:03,742 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:03,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:10:03,743 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 741472386, now seen corresponding path program 1 times [2022-01-10 00:10:03,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:03,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342749007] [2022-01-10 00:10:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:03,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:10:03,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:03,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342749007] [2022-01-10 00:10:03,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342749007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:03,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:03,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:10:03,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042934649] [2022-01-10 00:10:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:03,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:03,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:03,848 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:07,438 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2022-01-10 00:10:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-01-10 00:10:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:07,453 INFO L225 Difference]: With dead ends: 5384 [2022-01-10 00:10:07,454 INFO L226 Difference]: Without dead ends: 3492 [2022-01-10 00:10:07,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:07,460 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:07,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [922 Valid, 1013 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-01-10 00:10:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2022-01-10 00:10:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2022-01-10 00:10:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2022-01-10 00:10:07,541 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 94 [2022-01-10 00:10:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:07,542 INFO L470 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2022-01-10 00:10:07,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2022-01-10 00:10:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-10 00:10:07,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:07,548 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:07,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:10:07,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1046705063, now seen corresponding path program 1 times [2022-01-10 00:10:07,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:07,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618969204] [2022-01-10 00:10:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:07,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:10:07,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:07,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618969204] [2022-01-10 00:10:07,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618969204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:07,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:07,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:10:07,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582384767] [2022-01-10 00:10:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:07,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:07,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:07,628 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:10,720 INFO L93 Difference]: Finished difference Result 10169 states and 15700 transitions. [2022-01-10 00:10:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-01-10 00:10:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:10,755 INFO L225 Difference]: With dead ends: 10169 [2022-01-10 00:10:10,755 INFO L226 Difference]: Without dead ends: 6680 [2022-01-10 00:10:10,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:10,764 INFO L933 BasicCegarLoop]: 714 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:10,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 847 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:10:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2022-01-10 00:10:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6669. [2022-01-10 00:10:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 6668 states have (on average 1.375224955008998) internal successors, (9170), 6668 states have internal predecessors, (9170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 9170 transitions. [2022-01-10 00:10:10,917 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 9170 transitions. Word has length 96 [2022-01-10 00:10:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:10,918 INFO L470 AbstractCegarLoop]: Abstraction has 6669 states and 9170 transitions. [2022-01-10 00:10:10,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 9170 transitions. [2022-01-10 00:10:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 00:10:10,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:10,922 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:10,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:10:10,923 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 248170165, now seen corresponding path program 1 times [2022-01-10 00:10:10,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:10,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873953075] [2022-01-10 00:10:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:10,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:10:11,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:11,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873953075] [2022-01-10 00:10:11,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873953075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:11,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:11,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:10:11,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351220974] [2022-01-10 00:10:11,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:11,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:11,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:11,125 INFO L87 Difference]: Start difference. First operand 6669 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:13,800 INFO L93 Difference]: Finished difference Result 14123 states and 19185 transitions. [2022-01-10 00:10:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-10 00:10:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:13,827 INFO L225 Difference]: With dead ends: 14123 [2022-01-10 00:10:13,827 INFO L226 Difference]: Without dead ends: 7456 [2022-01-10 00:10:13,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:13,839 INFO L933 BasicCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:13,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 00:10:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2022-01-10 00:10:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2022-01-10 00:10:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2022-01-10 00:10:14,095 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 140 [2022-01-10 00:10:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:14,097 INFO L470 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2022-01-10 00:10:14,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2022-01-10 00:10:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 00:10:14,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:14,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:14,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:10:14,100 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1870627551, now seen corresponding path program 1 times [2022-01-10 00:10:14,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:14,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212219008] [2022-01-10 00:10:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:14,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 00:10:14,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:14,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212219008] [2022-01-10 00:10:14,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212219008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:14,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:14,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:10:14,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964503478] [2022-01-10 00:10:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:14,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:14,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:14,250 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:17,354 INFO L93 Difference]: Finished difference Result 19656 states and 26991 transitions. [2022-01-10 00:10:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 00:10:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:17,390 INFO L225 Difference]: With dead ends: 19656 [2022-01-10 00:10:17,390 INFO L226 Difference]: Without dead ends: 12989 [2022-01-10 00:10:17,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:17,403 INFO L933 BasicCegarLoop]: 1071 mSDtfsCounter, 737 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:17,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [737 Valid, 1222 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:10:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2022-01-10 00:10:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2022-01-10 00:10:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2022-01-10 00:10:17,614 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 154 [2022-01-10 00:10:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:17,615 INFO L470 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2022-01-10 00:10:17,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2022-01-10 00:10:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-10 00:10:17,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:17,620 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:17,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:10:17,622 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:17,622 INFO L85 PathProgramCache]: Analyzing trace with hash -538681918, now seen corresponding path program 1 times [2022-01-10 00:10:17,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497674346] [2022-01-10 00:10:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:17,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-01-10 00:10:17,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:17,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497674346] [2022-01-10 00:10:17,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497674346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:17,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:17,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:10:17,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003157633] [2022-01-10 00:10:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:17,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:17,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:17,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:17,782 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:20,808 INFO L93 Difference]: Finished difference Result 22792 states and 28651 transitions. [2022-01-10 00:10:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2022-01-10 00:10:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:20,833 INFO L225 Difference]: With dead ends: 22792 [2022-01-10 00:10:20,833 INFO L226 Difference]: Without dead ends: 12980 [2022-01-10 00:10:20,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:20,846 INFO L933 BasicCegarLoop]: 1027 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:20,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 1211 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-10 00:10:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2022-01-10 00:10:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 12972. [2022-01-10 00:10:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2347544522396114) internal successors, (16016), 12971 states have internal predecessors, (16016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16016 transitions. [2022-01-10 00:10:21,057 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16016 transitions. Word has length 241 [2022-01-10 00:10:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:21,058 INFO L470 AbstractCegarLoop]: Abstraction has 12972 states and 16016 transitions. [2022-01-10 00:10:21,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16016 transitions. [2022-01-10 00:10:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-10 00:10:21,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:21,064 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:21,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:10:21,064 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2012805208, now seen corresponding path program 1 times [2022-01-10 00:10:21,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416037755] [2022-01-10 00:10:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:21,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:10:21,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:21,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416037755] [2022-01-10 00:10:21,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416037755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:21,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:21,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:10:21,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516666589] [2022-01-10 00:10:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:21,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:21,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:21,187 INFO L87 Difference]: Start difference. First operand 12972 states and 16016 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:24,400 INFO L93 Difference]: Finished difference Result 36166 states and 45134 transitions. [2022-01-10 00:10:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:24,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2022-01-10 00:10:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:24,449 INFO L225 Difference]: With dead ends: 36166 [2022-01-10 00:10:24,450 INFO L226 Difference]: Without dead ends: 23196 [2022-01-10 00:10:24,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:24,472 INFO L933 BasicCegarLoop]: 1851 mSDtfsCounter, 841 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:24,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [841 Valid, 1989 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:10:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23196 states. [2022-01-10 00:10:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23196 to 22404. [2022-01-10 00:10:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22404 states, 22403 states have (on average 1.1931884122662144) internal successors, (26731), 22403 states have internal predecessors, (26731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22404 states to 22404 states and 26731 transitions. [2022-01-10 00:10:24,752 INFO L78 Accepts]: Start accepts. Automaton has 22404 states and 26731 transitions. Word has length 243 [2022-01-10 00:10:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:24,752 INFO L470 AbstractCegarLoop]: Abstraction has 22404 states and 26731 transitions. [2022-01-10 00:10:24,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22404 states and 26731 transitions. [2022-01-10 00:10:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-01-10 00:10:24,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:24,757 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:24,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:10:24,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -4245416, now seen corresponding path program 1 times [2022-01-10 00:10:24,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525075042] [2022-01-10 00:10:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:24,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 00:10:24,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525075042] [2022-01-10 00:10:24,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525075042] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:24,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:24,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:10:24,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356041223] [2022-01-10 00:10:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:24,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:24,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:24,868 INFO L87 Difference]: Start difference. First operand 22404 states and 26731 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:28,128 INFO L93 Difference]: Finished difference Result 55046 states and 66948 transitions. [2022-01-10 00:10:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2022-01-10 00:10:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:28,179 INFO L225 Difference]: With dead ends: 55046 [2022-01-10 00:10:28,179 INFO L226 Difference]: Without dead ends: 33431 [2022-01-10 00:10:28,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:28,207 INFO L933 BasicCegarLoop]: 809 mSDtfsCounter, 884 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:28,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 926 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:10:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33431 states. [2022-01-10 00:10:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33431 to 32635. [2022-01-10 00:10:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32635 states, 32634 states have (on average 1.1762578905436047) internal successors, (38386), 32634 states have internal predecessors, (38386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32635 states to 32635 states and 38386 transitions. [2022-01-10 00:10:28,586 INFO L78 Accepts]: Start accepts. Automaton has 32635 states and 38386 transitions. Word has length 265 [2022-01-10 00:10:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:28,586 INFO L470 AbstractCegarLoop]: Abstraction has 32635 states and 38386 transitions. [2022-01-10 00:10:28,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32635 states and 38386 transitions. [2022-01-10 00:10:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 00:10:28,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:28,590 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:28,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:10:28,591 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -596585222, now seen corresponding path program 1 times [2022-01-10 00:10:28,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:28,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030620337] [2022-01-10 00:10:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:28,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 53 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:10:28,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030620337] [2022-01-10 00:10:28,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030620337] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:10:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628084865] [2022-01-10 00:10:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:28,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:10:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:10:28,888 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) [2022-01-10 00:10:28,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:10:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:29,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:10:29,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:10:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-01-10 00:10:29,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:10:29,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628084865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:29,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:10:29,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-01-10 00:10:29,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696920491] [2022-01-10 00:10:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:29,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:29,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:29,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:10:29,430 INFO L87 Difference]: Start difference. First operand 32635 states and 38386 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:32,423 INFO L93 Difference]: Finished difference Result 64479 states and 75977 transitions. [2022-01-10 00:10:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2022-01-10 00:10:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:32,462 INFO L225 Difference]: With dead ends: 64479 [2022-01-10 00:10:32,462 INFO L226 Difference]: Without dead ends: 32633 [2022-01-10 00:10:32,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:10:32,473 INFO L933 BasicCegarLoop]: 1359 mSDtfsCounter, 1178 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:32,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1178 Valid, 1441 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 00:10:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32633 states. [2022-01-10 00:10:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32633 to 32632. [2022-01-10 00:10:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32632 states, 32631 states have (on average 1.1368330728448408) internal successors, (37096), 32631 states have internal predecessors, (37096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32632 states to 32632 states and 37096 transitions. [2022-01-10 00:10:33,000 INFO L78 Accepts]: Start accepts. Automaton has 32632 states and 37096 transitions. Word has length 270 [2022-01-10 00:10:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:33,001 INFO L470 AbstractCegarLoop]: Abstraction has 32632 states and 37096 transitions. [2022-01-10 00:10:33,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32632 states and 37096 transitions. [2022-01-10 00:10:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 00:10:33,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:33,004 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:33,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:10:33,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:10:33,212 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1197651363, now seen corresponding path program 1 times [2022-01-10 00:10:33,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:33,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735602782] [2022-01-10 00:10:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:33,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 00:10:33,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:33,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735602782] [2022-01-10 00:10:33,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735602782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:33,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:33,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:10:33,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685468838] [2022-01-10 00:10:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:33,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:33,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:33,340 INFO L87 Difference]: Start difference. First operand 32632 states and 37096 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:36,722 INFO L93 Difference]: Finished difference Result 76288 states and 87829 transitions. [2022-01-10 00:10:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2022-01-10 00:10:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:36,773 INFO L225 Difference]: With dead ends: 76288 [2022-01-10 00:10:36,774 INFO L226 Difference]: Without dead ends: 44445 [2022-01-10 00:10:36,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:10:36,800 INFO L933 BasicCegarLoop]: 1802 mSDtfsCounter, 834 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:36,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 1945 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-10 00:10:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44445 states. [2022-01-10 00:10:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44445 to 43654. [2022-01-10 00:10:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43654 states, 43653 states have (on average 1.1179300391725655) internal successors, (48801), 43653 states have internal predecessors, (48801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43654 states to 43654 states and 48801 transitions. [2022-01-10 00:10:37,378 INFO L78 Accepts]: Start accepts. Automaton has 43654 states and 48801 transitions. Word has length 320 [2022-01-10 00:10:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:37,379 INFO L470 AbstractCegarLoop]: Abstraction has 43654 states and 48801 transitions. [2022-01-10 00:10:37,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 43654 states and 48801 transitions. [2022-01-10 00:10:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2022-01-10 00:10:37,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:37,384 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:37,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:10:37,384 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1315903409, now seen corresponding path program 1 times [2022-01-10 00:10:37,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:37,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965164287] [2022-01-10 00:10:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:37,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 113 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 00:10:37,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965164287] [2022-01-10 00:10:37,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965164287] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:10:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309785457] [2022-01-10 00:10:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:37,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:10:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:10:37,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:10:37,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:10:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:38,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:10:38,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:10:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-01-10 00:10:38,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:10:38,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309785457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:38,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:10:38,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-01-10 00:10:38,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470320564] [2022-01-10 00:10:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:38,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:10:38,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:10:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:10:38,501 INFO L87 Difference]: Start difference. First operand 43654 states and 48801 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:10:41,448 INFO L93 Difference]: Finished difference Result 86510 states and 96800 transitions. [2022-01-10 00:10:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:10:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2022-01-10 00:10:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:10:41,497 INFO L225 Difference]: With dead ends: 86510 [2022-01-10 00:10:41,497 INFO L226 Difference]: Without dead ends: 43645 [2022-01-10 00:10:41,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:10:41,521 INFO L933 BasicCegarLoop]: 685 mSDtfsCounter, 1074 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:10:41,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 813 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 00:10:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2022-01-10 00:10:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 43644. [2022-01-10 00:10:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43644 states, 43643 states have (on average 1.086634740966478) internal successors, (47424), 43643 states have internal predecessors, (47424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43644 states to 43644 states and 47424 transitions. [2022-01-10 00:10:41,964 INFO L78 Accepts]: Start accepts. Automaton has 43644 states and 47424 transitions. Word has length 335 [2022-01-10 00:10:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:10:41,965 INFO L470 AbstractCegarLoop]: Abstraction has 43644 states and 47424 transitions. [2022-01-10 00:10:41,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:10:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 43644 states and 47424 transitions. [2022-01-10 00:10:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-01-10 00:10:41,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:10:41,970 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:10:41,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:10:42,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 00:10:42,195 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:10:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:10:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1592619154, now seen corresponding path program 1 times [2022-01-10 00:10:42,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:10:42,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128324325] [2022-01-10 00:10:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:10:42,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:10:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:10:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-01-10 00:10:42,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:10:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128324325] [2022-01-10 00:10:42,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128324325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:10:42,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:10:42,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:10:42,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209105069] [2022-01-10 00:10:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:10:42,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:10:42,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:10:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:10:42,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:10:42,307 INFO L87 Difference]: Start difference. First operand 43644 states and 47424 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)