/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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:47:06,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:47:06,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:47:06,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:47:06,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:47:06,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:47:06,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:47:06,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:47:06,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:47:06,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:47:06,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:47:06,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:47:06,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:47:06,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:47:06,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:47:06,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:47:06,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:47:06,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:47:06,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:47:06,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:47:06,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:47:06,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:47:06,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:47:06,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:47:06,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:47:06,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:47:06,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:47:06,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:47:06,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:47:06,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:47:06,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:47:06,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:47:06,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:47:06,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:47:06,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:47:06,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:47:06,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:47:06,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:47:06,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:47:06,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:47:06,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:47:06,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:47:06,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:47:06,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:47:06,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:47:06,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:47:06,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:47:06,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:47:06,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:47:06,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:47:06,580 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:47:06,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:47:06,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:47:06,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:47:06,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:47:06,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:47:06,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:47:06,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:47:06,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:47:06,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:47:06,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:47:06,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:47:06,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:47:06,585 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 03:47:06,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:47:06,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:47:06,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:47:06,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:47:06,867 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:47:06,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr3.c [2022-01-10 03:47:06,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1482c2e3/3192132492ba428288194dfee2d84e79/FLAG899927d9f [2022-01-10 03:47:07,345 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:47:07,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr3.c [2022-01-10 03:47:07,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1482c2e3/3192132492ba428288194dfee2d84e79/FLAG899927d9f [2022-01-10 03:47:07,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1482c2e3/3192132492ba428288194dfee2d84e79 [2022-01-10 03:47:07,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:47:07,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:47:07,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:47:07,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:47:07,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:47:07,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fa58bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07, skipping insertion in model container [2022-01-10 03:47:07,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:47:07,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:47:07,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr3.c[396,409] [2022-01-10 03:47:07,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:47:07,563 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:47:07,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr3.c[396,409] [2022-01-10 03:47:07,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:47:07,610 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:47:07,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07 WrapperNode [2022-01-10 03:47:07,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:47:07,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:47:07,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:47:07,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:47:07,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,648 INFO L137 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-01-10 03:47:07,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:47:07,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:47:07,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:47:07,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:47:07,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:47:07,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:47:07,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:47:07,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:47:07,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (1/1) ... [2022-01-10 03:47:07,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:47:07,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:47:07,710 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 03:47:07,719 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 03:47:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:47:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:47:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 03:47:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 03:47:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:47:07,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:47:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 03:47:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 03:47:07,812 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:47:07,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:47:08,260 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:47:08,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:47:08,265 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 03:47:08,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:47:08 BoogieIcfgContainer [2022-01-10 03:47:08,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:47:08,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:47:08,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:47:08,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:47:08,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:47:07" (1/3) ... [2022-01-10 03:47:08,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bee588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:47:08, skipping insertion in model container [2022-01-10 03:47:08,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:47:07" (2/3) ... [2022-01-10 03:47:08,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bee588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:47:08, skipping insertion in model container [2022-01-10 03:47:08,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:47:08" (3/3) ... [2022-01-10 03:47:08,274 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2022-01-10 03:47:08,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:47:08,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:47:08,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:47:08,341 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 03:47:08,341 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:47:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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 03:47:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 03:47:08,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:08,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:47:08,361 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -565609025, now seen corresponding path program 1 times [2022-01-10 03:47:08,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024266722] [2022-01-10 03:47:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:08,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:08,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:08,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:47:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:08,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:47:08,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:08,536 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 03:47:08,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:47:08,537 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024266722] [2022-01-10 03:47:08,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024266722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:47:08,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:47:08,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:47:08,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759981101] [2022-01-10 03:47:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:47:08,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:47:08,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:47:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:47:08,572 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 03:47:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:08,590 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-01-10 03:47:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:47:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2022-01-10 03:47:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:08,599 INFO L225 Difference]: With dead ends: 63 [2022-01-10 03:47:08,599 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 03:47:08,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:47:08,605 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:08,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:47:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 03:47:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 03:47:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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 03:47:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 03:47:08,638 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-01-10 03:47:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:08,638 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 03:47:08,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 03:47:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 03:47:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 03:47:08,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:08,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:47:08,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:08,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:08,851 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1539779609, now seen corresponding path program 1 times [2022-01-10 03:47:08,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:08,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227791500] [2022-01-10 03:47:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:08,853 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:08,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:08,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:47:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:08,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:47:08,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:09,484 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 03:47:09,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:47:09,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227791500] [2022-01-10 03:47:09,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227791500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:47:09,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:47:09,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:47:09,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669463631] [2022-01-10 03:47:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:47:09,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:47:09,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:09,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:47:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:47:09,488 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 03:47:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:10,161 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-01-10 03:47:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:47:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-01-10 03:47:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:10,165 INFO L225 Difference]: With dead ends: 60 [2022-01-10 03:47:10,165 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 03:47:10,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:47:10,167 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:10,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 03:47:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 03:47:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-01-10 03:47:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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 03:47:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-01-10 03:47:10,172 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2022-01-10 03:47:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:10,173 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-01-10 03:47:10,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 03:47:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-01-10 03:47:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:47:10,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:10,174 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 03:47:10,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:10,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:10,388 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2048665896, now seen corresponding path program 1 times [2022-01-10 03:47:10,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:10,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833754462] [2022-01-10 03:47:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:10,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:10,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:10,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:47:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:10,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:47:10,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:47:10,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:47:10,601 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833754462] [2022-01-10 03:47:10,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833754462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:47:10,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:47:10,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:47:10,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734959419] [2022-01-10 03:47:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:47:10,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:47:10,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:47:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:47:10,603 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:10,637 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-01-10 03:47:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:47:10,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:10,639 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:47:10,639 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 03:47:10,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 03:47:10,641 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:10,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:47:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 03:47:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-10 03:47:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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 03:47:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-01-10 03:47:10,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 29 [2022-01-10 03:47:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:10,649 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-01-10 03:47:10,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-01-10 03:47:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:47:10,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:10,650 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 03:47:10,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:10,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:10,862 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1853274390, now seen corresponding path program 1 times [2022-01-10 03:47:10,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:10,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484161603] [2022-01-10 03:47:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:10,863 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:10,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:10,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:47:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:10,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:47:10,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 03:47:11,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:47:11,035 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:11,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484161603] [2022-01-10 03:47:11,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484161603] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:47:11,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:47:11,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:47:11,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873865824] [2022-01-10 03:47:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:47:11,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:47:11,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:47:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:47:11,042 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 03:47:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:11,088 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-01-10 03:47:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:47:11,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 03:47:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:11,089 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:47:11,089 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:47:11,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:47:11,091 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:11,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:47:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:47:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-10 03:47:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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 03:47:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-10 03:47:11,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 29 [2022-01-10 03:47:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:11,096 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-10 03:47:11,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 03:47:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-10 03:47:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:47:11,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:11,097 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 03:47:11,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:11,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:11,297 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1853333972, now seen corresponding path program 1 times [2022-01-10 03:47:11,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:11,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088778098] [2022-01-10 03:47:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:11,299 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:11,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:11,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:47:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:11,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 03:47:11,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:11,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-01-10 03:47:11,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,593 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:11,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 40 [2022-01-10 03:47:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:11,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-01-10 03:47:11,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:11,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-10 03:47:11,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:11,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2022-01-10 03:47:11,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 17 [2022-01-10 03:47:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:47:11,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:21,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-01-10 03:47:21,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 126 [2022-01-10 03:47:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:47:21,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088778098] [2022-01-10 03:47:21,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088778098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:47:21,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:47:21,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2022-01-10 03:47:21,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987742775] [2022-01-10 03:47:21,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:47:21,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:47:21,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:47:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=182, Unknown=2, NotChecked=0, Total=240 [2022-01-10 03:47:21,667 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 03:47:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:22,341 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-01-10 03:47:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:47:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 03:47:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:22,343 INFO L225 Difference]: With dead ends: 104 [2022-01-10 03:47:22,343 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 03:47:22,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=142, Invalid=408, Unknown=2, NotChecked=0, Total=552 [2022-01-10 03:47:22,345 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 97 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:22,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 107 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2022-01-10 03:47:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 03:47:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2022-01-10 03:47:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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 03:47:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-01-10 03:47:22,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 29 [2022-01-10 03:47:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:22,352 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-01-10 03:47:22,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 03:47:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-01-10 03:47:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:47:22,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:22,353 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 03:47:22,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:22,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:22,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash 832265618, now seen corresponding path program 1 times [2022-01-10 03:47:22,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925790960] [2022-01-10 03:47:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:22,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:22,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:22,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:22,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:47:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:22,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:47:22,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:47:22,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:47:22,764 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925790960] [2022-01-10 03:47:22,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925790960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:47:22,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:47:22,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:47:22,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117930477] [2022-01-10 03:47:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:47:22,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:47:22,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:47:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:47:22,766 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:22,787 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-01-10 03:47:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:47:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:22,788 INFO L225 Difference]: With dead ends: 74 [2022-01-10 03:47:22,788 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 03:47:22,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 03:47:22,789 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:22,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:47:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 03:47:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 03:47:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 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 03:47:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-01-10 03:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 29 [2022-01-10 03:47:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:22,795 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-01-10 03:47:22,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:47:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-01-10 03:47:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 03:47:22,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:22,796 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 03:47:22,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:22,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:22,997 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1996937229, now seen corresponding path program 2 times [2022-01-10 03:47:22,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030394643] [2022-01-10 03:47:22,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:47:22,998 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:22,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:47:23,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:47:23,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:47:23,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:47:23,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:24,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:25,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:25,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030394643] [2022-01-10 03:47:25,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030394643] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:47:25,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:47:25,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-01-10 03:47:25,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532497534] [2022-01-10 03:47:25,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:47:25,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 03:47:25,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 03:47:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:47:25,267 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 03:47:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:27,507 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-01-10 03:47:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:47:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 33 [2022-01-10 03:47:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:27,510 INFO L225 Difference]: With dead ends: 128 [2022-01-10 03:47:27,510 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 03:47:27,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:47:27,511 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 240 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:27,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 66 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 03:47:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 03:47:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2022-01-10 03:47:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 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 03:47:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-01-10 03:47:27,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 33 [2022-01-10 03:47:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:27,521 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-01-10 03:47:27,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 03:47:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-01-10 03:47:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 03:47:27,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:27,522 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 03:47:27,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 03:47:27,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:27,724 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:27,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash -781161777, now seen corresponding path program 3 times [2022-01-10 03:47:27,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922041652] [2022-01-10 03:47:27,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:47:27,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:27,726 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:27,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:47:27,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 03:47:27,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:47:27,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:47:27,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:28,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:29,784 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922041652] [2022-01-10 03:47:29,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922041652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:47:29,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:47:29,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-10 03:47:29,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422048039] [2022-01-10 03:47:29,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:47:29,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 03:47:29,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 03:47:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:47:29,786 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 03:47:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:31,921 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-01-10 03:47:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:47:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 33 [2022-01-10 03:47:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:31,925 INFO L225 Difference]: With dead ends: 121 [2022-01-10 03:47:31,925 INFO L226 Difference]: Without dead ends: 104 [2022-01-10 03:47:31,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:47:31,926 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 261 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:31,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 82 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 03:47:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-10 03:47:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2022-01-10 03:47:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 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 03:47:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-01-10 03:47:31,933 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 33 [2022-01-10 03:47:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:31,933 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-01-10 03:47:31,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 03:47:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-01-10 03:47:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 03:47:31,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:31,934 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 03:47:31,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:32,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:32,136 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:32,137 INFO L85 PathProgramCache]: Analyzing trace with hash -166695065, now seen corresponding path program 1 times [2022-01-10 03:47:32,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:32,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785936539] [2022-01-10 03:47:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:47:32,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:32,138 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:32,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:47:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:47:32,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 03:47:32,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:32,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-01-10 03:47:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:32,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:32,394 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:32,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 40 [2022-01-10 03:47:32,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:32,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:32,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:32,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-01-10 03:47:32,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 17 [2022-01-10 03:47:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:32,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:33,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-01-10 03:47:33,262 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:33,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 872 treesize of output 836 [2022-01-10 03:47:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:47:33,826 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785936539] [2022-01-10 03:47:33,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785936539] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:47:33,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:47:33,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2022-01-10 03:47:33,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152238800] [2022-01-10 03:47:33,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:47:33,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:47:33,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:47:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:47:33,828 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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 03:47:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:34,353 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-01-10 03:47:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:47:34,353 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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 35 [2022-01-10 03:47:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:34,354 INFO L225 Difference]: With dead ends: 94 [2022-01-10 03:47:34,354 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 03:47:34,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2022-01-10 03:47:34,355 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 160 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:34,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 112 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 193 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2022-01-10 03:47:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 03:47:34,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2022-01-10 03:47:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 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 03:47:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-01-10 03:47:34,370 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 35 [2022-01-10 03:47:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:34,370 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-01-10 03:47:34,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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 03:47:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-01-10 03:47:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:47:34,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:34,371 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-10 03:47:34,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:34,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:34,575 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 693076666, now seen corresponding path program 2 times [2022-01-10 03:47:34,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:34,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171351718] [2022-01-10 03:47:34,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:47:34,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:34,577 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:34,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:47:34,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:47:34,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:47:34,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 03:47:34,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:34,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-01-10 03:47:34,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:34,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:34,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:34,784 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:34,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 40 [2022-01-10 03:47:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:47:35,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:35,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-01-10 03:47:35,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:35,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1734 treesize of output 1640 [2022-01-10 03:47:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:47:36,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:36,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171351718] [2022-01-10 03:47:36,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171351718] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:47:36,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:47:36,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-10 03:47:36,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489050933] [2022-01-10 03:47:36,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:47:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 03:47:36,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:47:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 03:47:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-01-10 03:47:36,472 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 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 03:47:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:47:37,392 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-01-10 03:47:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-10 03:47:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 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 41 [2022-01-10 03:47:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:47:37,393 INFO L225 Difference]: With dead ends: 118 [2022-01-10 03:47:37,393 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 03:47:37,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 03:47:37,394 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 219 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 03:47:37,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 127 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 306 Invalid, 0 Unknown, 18 Unchecked, 0.5s Time] [2022-01-10 03:47:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 03:47:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2022-01-10 03:47:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.130952380952381) internal successors, (95), 84 states have internal predecessors, (95), 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 03:47:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2022-01-10 03:47:37,405 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 41 [2022-01-10 03:47:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:47:37,405 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2022-01-10 03:47:37,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 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 03:47:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-01-10 03:47:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:47:37,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:47:37,407 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 03:47:37,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:37,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:37,623 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:47:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:47:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1371646333, now seen corresponding path program 4 times [2022-01-10 03:47:37,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:47:37,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697800524] [2022-01-10 03:47:37,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:47:37,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:47:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:47:37,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:47:37,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:47:37,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:47:37,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:47:37,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-10 03:47:37,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:47:37,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-01-10 03:47:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:37,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:37,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:37,930 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 03:47:37,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 52 [2022-01-10 03:47:38,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:38,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-01-10 03:47:38,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:38,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 36 [2022-01-10 03:47:38,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:38,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-01-10 03:47:38,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:38,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2022-01-10 03:47:38,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 36 [2022-01-10 03:47:38,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-01-10 03:47:38,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:47:38,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-01-10 03:47:38,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 17 [2022-01-10 03:47:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:47:38,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:47:41,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2022-01-10 03:47:41,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5046 treesize of output 5018 [2022-01-10 03:47:42,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:47:42,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697800524] [2022-01-10 03:47:42,639 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 03:47:42,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 03:47:42,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:47:42,840 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 03:47:42,843 INFO L158 Benchmark]: Toolchain (without parser) took 35480.17ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 119.5MB in the beginning and 201.2MB in the end (delta: -81.6MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,843 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:47:42,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.55ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 119.4MB in the beginning and 208.1MB in the end (delta: -88.7MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.38ms. Allocated memory is still 235.9MB. Free memory was 208.1MB in the beginning and 206.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,844 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 235.9MB. Free memory was 206.0MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,844 INFO L158 Benchmark]: RCFGBuilder took 590.88ms. Allocated memory is still 235.9MB. Free memory was 204.4MB in the beginning and 189.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,844 INFO L158 Benchmark]: TraceAbstraction took 34574.98ms. Allocated memory is still 235.9MB. Free memory was 189.2MB in the beginning and 201.2MB in the end (delta: -11.9MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. [2022-01-10 03:47:42,845 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.55ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 119.4MB in the beginning and 208.1MB in the end (delta: -88.7MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.38ms. Allocated memory is still 235.9MB. Free memory was 208.1MB in the beginning and 206.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 235.9MB. Free memory was 206.0MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 590.88ms. Allocated memory is still 235.9MB. Free memory was 204.4MB in the beginning and 189.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 34574.98ms. Allocated memory is still 235.9MB. Free memory was 189.2MB in the beginning and 201.2MB in the end (delta: -11.9MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 03:47:42,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...