/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/ldv-regression/test25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:02:42,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:02:42,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:02:42,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:02:42,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:02:42,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:02:42,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:02:42,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:02:42,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:02:42,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:02:42,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:02:42,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:02:42,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:02:42,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:02:42,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:02:42,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:02:42,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:02:42,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:02:42,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:02:42,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:02:42,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:02:42,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:02:42,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:02:42,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:02:42,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:02:42,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:02:42,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:02:42,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:02:42,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:02:42,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:02:42,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:02:42,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:02:42,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:02:42,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:02:42,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:02:42,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:02:42,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:02:42,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:02:42,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:02:42,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:02:42,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:02:42,668 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 06:02:42,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:02:42,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:02:42,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:02:42,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:02:42,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:02:42,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:02:42,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:02:42,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:02:42,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:02:42,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:02:42,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:02:42,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:02:42,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:02:42,686 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 06:02:42,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:02:42,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:02:42,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:02:42,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:02:42,898 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:02:42,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-1.c [2022-01-10 06:02:42,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de0ebf7a/a4f91c0f5fc44a59bae2b485deb5799d/FLAG6ac911501 [2022-01-10 06:02:43,291 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:02:43,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-1.c [2022-01-10 06:02:43,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de0ebf7a/a4f91c0f5fc44a59bae2b485deb5799d/FLAG6ac911501 [2022-01-10 06:02:43,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de0ebf7a/a4f91c0f5fc44a59bae2b485deb5799d [2022-01-10 06:02:43,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:02:43,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:02:43,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:02:43,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:02:43,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:02:43,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd34afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43, skipping insertion in model container [2022-01-10 06:02:43,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:02:43,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:02:43,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-1.c[936,949] [2022-01-10 06:02:43,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:02:43,517 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:02:43,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-1.c[936,949] [2022-01-10 06:02:43,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:02:43,563 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:02:43,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43 WrapperNode [2022-01-10 06:02:43,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:02:43,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:02:43,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:02:43,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:02:43,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,605 INFO L137 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-01-10 06:02:43,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:02:43,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:02:43,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:02:43,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:02:43,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:02:43,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:02:43,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:02:43,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:02:43,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (1/1) ... [2022-01-10 06:02:43,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:02:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:02:43,677 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 06:02:43,702 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 06:02:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:02:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:02:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:02:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:02:43,824 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:02:43,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:02:43,989 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:02:43,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:02:43,994 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 06:02:43,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:02:43 BoogieIcfgContainer [2022-01-10 06:02:43,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:02:43,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:02:43,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:02:44,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:02:44,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:02:43" (1/3) ... [2022-01-10 06:02:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc4fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:02:44, skipping insertion in model container [2022-01-10 06:02:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:43" (2/3) ... [2022-01-10 06:02:44,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc4fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:02:44, skipping insertion in model container [2022-01-10 06:02:44,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:02:43" (3/3) ... [2022-01-10 06:02:44,008 INFO L111 eAbstractionObserver]: Analyzing ICFG test25-1.c [2022-01-10 06:02:44,011 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:02:44,011 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:02:44,040 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:02:44,045 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 06:02:44,046 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:02:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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 06:02:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 06:02:44,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:44,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:44,060 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2022-01-10 06:02:44,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802672955] [2022-01-10 06:02:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:44,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:44,077 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 06:02:44,078 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 06:02:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:44,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:02:44,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:44,198 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 06:02:44,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:44,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802672955] [2022-01-10 06:02:44,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802672955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:44,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:44,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:02:44,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980104837] [2022-01-10 06:02:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:44,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:02:44,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:02:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:02:44,230 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 06:02:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:44,241 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-01-10 06:02:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:02:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-01-10 06:02:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:44,248 INFO L225 Difference]: With dead ends: 30 [2022-01-10 06:02:44,248 INFO L226 Difference]: Without dead ends: 13 [2022-01-10 06:02:44,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 06:02:44,253 INFO L933 BasicCegarLoop]: 20 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, 20 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 06:02:44,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:02:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-01-10 06:02:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-01-10 06:02:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 06:02:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-01-10 06:02:44,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2022-01-10 06:02:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:44,279 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-01-10 06:02:44,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 06:02:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-01-10 06:02:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:02:44,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:44,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:44,299 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 06:02:44,489 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 06:02:44,490 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:44,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2022-01-10 06:02:44,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:44,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835068912] [2022-01-10 06:02:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:44,492 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:44,493 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 06:02:44,494 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 06:02:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:44,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:02:44,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:44,616 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 06:02:44,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:44,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835068912] [2022-01-10 06:02:44,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835068912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:44,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:44,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:02:44,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220436801] [2022-01-10 06:02:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:44,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:02:44,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:02:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:02:44,625 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:02:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:44,662 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-01-10 06:02:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:02:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-01-10 06:02:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:44,667 INFO L225 Difference]: With dead ends: 24 [2022-01-10 06:02:44,667 INFO L226 Difference]: Without dead ends: 15 [2022-01-10 06:02:44,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 06:02:44,668 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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 06:02:44,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:02:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-10 06:02:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-01-10 06:02:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 06:02:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-01-10 06:02:44,671 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-01-10 06:02:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:44,672 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-01-10 06:02:44,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:02:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-01-10 06:02:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:02:44,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:44,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:44,685 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 06:02:44,879 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 06:02:44,880 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2022-01-10 06:02:44,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:44,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542250911] [2022-01-10 06:02:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:44,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:44,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:44,883 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 06:02:44,884 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 06:02:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:44,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:02:44,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:02:44,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:02:45,052 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:45,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542250911] [2022-01-10 06:02:45,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542250911] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:45,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:45,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:02:45,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688634023] [2022-01-10 06:02:45,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:45,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:02:45,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:02:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:02:45,059 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 06:02:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:45,166 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-01-10 06:02:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:02:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 13 [2022-01-10 06:02:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:45,168 INFO L225 Difference]: With dead ends: 29 [2022-01-10 06:02:45,168 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 06:02:45,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:02:45,169 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:45,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:02:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 06:02:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-10 06:02:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 06:02:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-01-10 06:02:45,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2022-01-10 06:02:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:45,172 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-01-10 06:02:45,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 06:02:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-01-10 06:02:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:02:45,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:45,173 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:45,180 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 06:02:45,373 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 06:02:45,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1444204464, now seen corresponding path program 2 times [2022-01-10 06:02:45,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:45,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117503317] [2022-01-10 06:02:45,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:02:45,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:45,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:45,377 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 06:02:45,379 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 06:02:45,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:02:45,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:02:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 06:02:45,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:45,668 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 24 treesize of output 12 [2022-01-10 06:02:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:02:45,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:45,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117503317] [2022-01-10 06:02:45,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117503317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:45,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:45,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:02:45,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910068611] [2022-01-10 06:02:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:45,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:02:45,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:02:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:02:45,713 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:02:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:45,866 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-01-10 06:02:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:02:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-01-10 06:02:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:45,868 INFO L225 Difference]: With dead ends: 27 [2022-01-10 06:02:45,868 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 06:02:45,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:02:45,869 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:45,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:02:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 06:02:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 06:02:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 06:02:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-01-10 06:02:45,872 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2022-01-10 06:02:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:45,872 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-01-10 06:02:45,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:02:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-01-10 06:02:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 06:02:45,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:45,873 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:45,883 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 06:02:46,073 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 06:02:46,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 1 times [2022-01-10 06:02:46,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:46,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371222688] [2022-01-10 06:02:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:46,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:46,076 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 06:02:46,077 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 06:02:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:46,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:02:46,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 06:02:46,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 06:02:46,384 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371222688] [2022-01-10 06:02:46,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371222688] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:46,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:46,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:02:46,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147433551] [2022-01-10 06:02:46,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:46,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:02:46,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:02:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:02:46,386 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 06:02:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:46,881 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-01-10 06:02:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:02:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 21 [2022-01-10 06:02:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:46,896 INFO L225 Difference]: With dead ends: 45 [2022-01-10 06:02:46,897 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 06:02:46,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:02:46,898 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:46,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:02:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 06:02:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 06:02:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 06:02:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-01-10 06:02:46,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2022-01-10 06:02:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:46,908 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-01-10 06:02:46,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 06:02:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-01-10 06:02:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 06:02:46,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:46,909 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:46,946 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 06:02:47,143 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 06:02:47,144 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash -926636855, now seen corresponding path program 2 times [2022-01-10 06:02:47,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:47,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953827373] [2022-01-10 06:02:47,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:02:47,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:47,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:47,146 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 06:02:47,148 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 06:02:47,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:02:47,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:02:47,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 06:02:47,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:47,583 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 24 treesize of output 12 [2022-01-10 06:02:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 06:02:47,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 06:02:50,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:50,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953827373] [2022-01-10 06:02:50,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953827373] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:50,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:50,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:02:50,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494120992] [2022-01-10 06:02:50,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:50,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:02:50,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:02:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2022-01-10 06:02:50,042 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 06:03:02,424 WARN L228 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 06:03:04,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:03:06,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:03:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:03:07,054 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-01-10 06:03:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:03:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 06:03:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:03:07,056 INFO L225 Difference]: With dead ends: 45 [2022-01-10 06:03:07,056 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:03:07,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=70, Invalid=201, Unknown=1, NotChecked=0, Total=272 [2022-01-10 06:03:07,057 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:03:07,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-01-10 06:03:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:03:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-10 06:03:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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 06:03:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-01-10 06:03:07,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2022-01-10 06:03:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:03:07,062 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-01-10 06:03:07,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 06:03:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-01-10 06:03:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 06:03:07,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:03:07,063 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:03:07,079 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 06:03:07,276 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 06:03:07,277 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:03:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:03:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1546516264, now seen corresponding path program 3 times [2022-01-10 06:03:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:03:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220196150] [2022-01-10 06:03:07,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:03:07,278 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:03:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:03:07,280 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 06:03:07,282 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 06:03:07,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-10 06:03:07,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:03:07,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 06:03:07,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:03:08,102 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 24 treesize of output 12 [2022-01-10 06:03:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 06:03:08,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:03:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-10 06:03:11,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:03:11,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220196150] [2022-01-10 06:03:11,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220196150] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:03:11,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:03:11,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-01-10 06:03:11,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717680034] [2022-01-10 06:03:11,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:03:11,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:03:11,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:03:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:03:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2022-01-10 06:03:11,425 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 06:03:14,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:03:16,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:03:18,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:03:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:03:22,621 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-01-10 06:03:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 06:03:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 39 [2022-01-10 06:03:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:03:22,625 INFO L225 Difference]: With dead ends: 57 [2022-01-10 06:03:22,625 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 06:03:22,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=268, Invalid=723, Unknown=1, NotChecked=0, Total=992 [2022-01-10 06:03:22,626 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:03:22,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2022-01-10 06:03:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 06:03:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-01-10 06:03:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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 06:03:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-01-10 06:03:22,633 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 39 [2022-01-10 06:03:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:03:22,633 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-01-10 06:03:22,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 06:03:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-01-10 06:03:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 06:03:22,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:03:22,634 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:03:22,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:03:22,841 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 06:03:22,841 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:03:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:03:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 562473782, now seen corresponding path program 4 times [2022-01-10 06:03:22,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:03:22,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702896011] [2022-01-10 06:03:22,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:03:22,858 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:03:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:03:22,859 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 06:03:22,871 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 06:03:23,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:03:23,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:03:23,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:03:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:03:24,299 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:03:24,299 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:03:24,300 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:03:24,351 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 06:03:24,507 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 06:03:24,511 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2022-01-10 06:03:24,514 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:03:24,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:03:24 BoogieIcfgContainer [2022-01-10 06:03:24,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:03:24,579 INFO L158 Benchmark]: Toolchain (without parser) took 41265.45ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 141.0MB in the beginning and 184.6MB in the end (delta: -43.5MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,579 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory was 157.4MB in the beginning and 157.3MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:03:24,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.57ms. Allocated memory is still 190.8MB. Free memory was 140.8MB in the beginning and 166.0MB in the end (delta: -25.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.48ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,580 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 162.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,580 INFO L158 Benchmark]: RCFGBuilder took 345.14ms. Allocated memory is still 190.8MB. Free memory was 162.8MB in the beginning and 150.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,580 INFO L158 Benchmark]: TraceAbstraction took 40582.23ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 150.3MB in the beginning and 184.6MB in the end (delta: -34.3MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-01-10 06:03:24,582 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.10ms. Allocated memory is still 190.8MB. Free memory was 157.4MB in the beginning and 157.3MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.57ms. Allocated memory is still 190.8MB. Free memory was 140.8MB in the beginning and 166.0MB in the end (delta: -25.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.48ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 162.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 345.14ms. Allocated memory is still 190.8MB. Free memory was 162.8MB in the beginning and 150.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40582.23ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 150.3MB in the beginning and 184.6MB in the end (delta: -34.3MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] struct cont cont; [L22] struct dummy array[10]; [L23] int i, *pa; [L24] i = __VERIFIER_nondet_int() [L26] int j = 0; VAL [array={5:0}, cont={7:0}, j=0] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=1] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=2] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=3] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=4] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=5] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=6] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=7] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=8] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=9] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={5:0}, cont={7:0}, j=10] [L26] COND FALSE !(j < 10) VAL [array={5:0}, cont={7:0}, j=10] [L31] COND TRUE i >= 0 && i < 9 [L32] cont.array = &array[i] [L33] EXPR cont.array [L33] pa = &cont.array[0].b [L34] EXPR cont.array [L34] EXPR cont.array[0].b VAL [array={5:0}, cont={7:0}, cont.array={5:0}, cont.array[0].b=1073741824, i=0, j=10, pa={5:4}] [L34] COND TRUE cont.array[0].b > 0 [L35] EXPR array[i].b [L35] i = array[i].b - 10 [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741814, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741815, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741815, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741816, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741816, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741817, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741817, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741818, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741818, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741819, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741819, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741820, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741820, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741821, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741821, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741822, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741822, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741823, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741823, j=10, pa={5:4}] [L36] COND TRUE i < *pa [L37] ++i VAL [array={5:0}, cont={7:0}, i=1073741824, j=10, pa={5:4}] [L36] EXPR \read(*pa) VAL [\read(*pa)=1073741824, array={5:0}, cont={7:0}, i=1073741824, j=10, pa={5:4}] [L36] COND FALSE !(i < *pa) [L39] CALL, EXPR check(&cont, i) [L16] EXPR pc->array [L16] EXPR pc->array[1].b [L16] return pc->array[1].b == i; [L39] RET, EXPR check(&cont, i) [L39] COND TRUE !check(&cont, i) [L47] reach_error() VAL [array={5:0}, cont={7:0}, i=1073741824, j=10, pa={5:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 89 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 197 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 43 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 420/498 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 06:03:24,709 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...