/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/nla-digbench-scaling/mannadiv_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:25:18,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:25:18,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:25:18,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:25:18,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:25:18,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:25:18,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:25:18,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:25:18,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:25:18,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:25:18,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:25:18,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:25:18,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:25:18,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:25:18,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:25:18,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:25:18,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:25:18,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:25:18,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:25:18,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:25:18,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:25:18,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:25:18,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:25:18,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:25:18,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:25:18,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:25:18,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:25:18,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:25:18,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:25:18,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:25:18,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:25:18,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:25:18,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:25:18,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:25:18,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:25:18,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:25:18,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:25:18,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:25:18,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:25:18,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:25:18,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:25:18,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:25:18,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:25:18,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:25:18,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:25:18,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:25:18,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:25:18,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:25:18,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:25:18,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:25:18,619 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:25:18,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:25:18,620 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:25:18,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:25:18,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:25:18,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:25:18,622 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:25:18,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:25:18,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:25:18,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:25:18,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:25:18,814 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:25:18,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-01-10 03:25:18,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407a7933f/74618b56b5c4451494550f6354840be7/FLAGc3901ff45 [2022-01-10 03:25:19,170 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:25:19,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-01-10 03:25:19,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407a7933f/74618b56b5c4451494550f6354840be7/FLAGc3901ff45 [2022-01-10 03:25:19,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407a7933f/74618b56b5c4451494550f6354840be7 [2022-01-10 03:25:19,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:25:19,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:25:19,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:25:19,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:25:19,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:25:19,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40176f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19, skipping insertion in model container [2022-01-10 03:25:19,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:25:19,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:25:19,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c[573,586] [2022-01-10 03:25:19,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:25:19,782 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:25:19,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c[573,586] [2022-01-10 03:25:19,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:25:19,802 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:25:19,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19 WrapperNode [2022-01-10 03:25:19,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:25:19,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:25:19,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:25:19,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:25:19,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,824 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-01-10 03:25:19,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:25:19,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:25:19,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:25:19,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:25:19,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:25:19,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:25:19,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:25:19,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:25:19,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (1/1) ... [2022-01-10 03:25:19,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:25:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:25:19,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:25:19,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:25:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:25:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:25:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:25:19,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:25:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:25:19,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:25:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:25:19,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:25:19,940 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:25:19,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:25:20,064 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:25:20,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:25:20,068 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:25:20,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:25:20 BoogieIcfgContainer [2022-01-10 03:25:20,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:25:20,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:25:20,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:25:20,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:25:20,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:25:19" (1/3) ... [2022-01-10 03:25:20,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77056001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:25:20, skipping insertion in model container [2022-01-10 03:25:20,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:25:19" (2/3) ... [2022-01-10 03:25:20,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77056001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:25:20, skipping insertion in model container [2022-01-10 03:25:20,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:25:20" (3/3) ... [2022-01-10 03:25:20,078 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.c [2022-01-10 03:25:20,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:25:20,083 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:25:20,151 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:25:20,170 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:25:20,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:25:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:25:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:25:20,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:20,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:20,195 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-01-10 03:25:20,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:20,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139193694] [2022-01-10 03:25:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:20,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:20,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:20,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:25:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:20,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:25:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:20,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:25:20,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139193694] [2022-01-10 03:25:20,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139193694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:25:20,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:25:20,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:25:20,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114739433] [2022-01-10 03:25:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:25:20,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:25:20,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:25:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:25:20,406 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:20,422 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-01-10 03:25:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:25:20,424 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-01-10 03:25:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:20,431 INFO L225 Difference]: With dead ends: 47 [2022-01-10 03:25:20,431 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 03:25:20,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:25:20,439 INFO L933 BasicCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:20,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:25:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 03:25:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 03:25:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:25:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 03:25:20,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-01-10 03:25:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:20,473 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 03:25:20,473 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 03:25:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:25:20,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:20,476 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:20,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:20,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:20,684 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-01-10 03:25:20,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:20,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849940719] [2022-01-10 03:25:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:20,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:20,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:20,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:25:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:20,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:25:20,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:20,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:25:20,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849940719] [2022-01-10 03:25:20,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849940719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:25:20,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:25:20,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:25:20,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625836668] [2022-01-10 03:25:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:25:20,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:25:20,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:25:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:25:20,836 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:20,849 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-01-10 03:25:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:25:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:25:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:20,850 INFO L225 Difference]: With dead ends: 30 [2022-01-10 03:25:20,850 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 03:25:20,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:25:20,852 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:20,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:25:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 03:25:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 03:25:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:25:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 03:25:20,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-01-10 03:25:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 03:25:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 03:25:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:25:20,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:20,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:20,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:21,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:21,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-01-10 03:25:21,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:21,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298966611] [2022-01-10 03:25:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:21,067 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:21,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:21,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:25:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:21,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:25:21,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:25:21,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:21,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:21,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298966611] [2022-01-10 03:25:21,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298966611] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:25:21,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:25:21,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-01-10 03:25:21,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875510109] [2022-01-10 03:25:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:25:21,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:25:21,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:25:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:25:21,506 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:21,559 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-01-10 03:25:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:25:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:25:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:21,563 INFO L225 Difference]: With dead ends: 30 [2022-01-10 03:25:21,563 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:25:21,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:25:21,564 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:21,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-01-10 03:25:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:25:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:25:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:25:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-10 03:25:21,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-01-10 03:25:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:21,570 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-10 03:25:21,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:25:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-10 03:25:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 03:25:21,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:21,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:21,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:21,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:21,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-01-10 03:25:21,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:21,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530433773] [2022-01-10 03:25:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:21,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:21,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:21,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:21,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:25:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:21,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:25:21,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:25:21,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:22,424 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:22,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530433773] [2022-01-10 03:25:22,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530433773] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:25:22,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1506728673] [2022-01-10 03:25:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:22,425 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:25:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:25:22,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:25:22,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-01-10 03:25:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:22,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:25:22,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:22,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:25:22,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1506728673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:25:22,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:25:22,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2022-01-10 03:25:22,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343757800] [2022-01-10 03:25:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:25:22,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:25:22,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:25:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:25:22,574 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:25:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:22,694 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-01-10 03:25:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:25:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-01-10 03:25:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:22,696 INFO L225 Difference]: With dead ends: 37 [2022-01-10 03:25:22,696 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 03:25:22,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:25:22,697 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:22,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:25:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 03:25:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-01-10 03:25:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:25:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-10 03:25:22,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2022-01-10 03:25:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:22,702 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-10 03:25:22,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:25:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-10 03:25:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:25:22,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:22,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:22,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:22,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:23,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 03:25:23,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-01-10 03:25:23,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:23,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911000883] [2022-01-10 03:25:23,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:23,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:23,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:23,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:23,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:25:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:23,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:25:23,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:23,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:23,317 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911000883] [2022-01-10 03:25:23,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911000883] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:23,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:23,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-01-10 03:25:23,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911713258] [2022-01-10 03:25:23,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:23,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:25:23,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:25:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:25:23,320 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:25:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:23,531 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-01-10 03:25:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:25:23,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-01-10 03:25:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:23,532 INFO L225 Difference]: With dead ends: 63 [2022-01-10 03:25:23,532 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 03:25:23,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:25:23,533 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:23,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:25:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 03:25:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-01-10 03:25:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 40 states have internal predecessors, (48), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:25:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-01-10 03:25:23,540 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2022-01-10 03:25:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:23,540 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-01-10 03:25:23,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:25:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-01-10 03:25:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:25:23,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:23,541 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:23,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:23,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:23,750 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -125182207, now seen corresponding path program 1 times [2022-01-10 03:25:23,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:23,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893649700] [2022-01-10 03:25:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:23,751 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:23,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:23,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:25:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:23,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 03:25:23,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 03:25:24,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:25,064 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893649700] [2022-01-10 03:25:25,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893649700] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:25,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:25,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2022-01-10 03:25:25,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829440555] [2022-01-10 03:25:25,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:25,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 03:25:25,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 03:25:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-10 03:25:25,065 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:25:28,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:25:31,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:25:32,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:25:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:32,528 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2022-01-10 03:25:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 03:25:32,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-01-10 03:25:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:32,532 INFO L225 Difference]: With dead ends: 116 [2022-01-10 03:25:32,532 INFO L226 Difference]: Without dead ends: 90 [2022-01-10 03:25:32,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-01-10 03:25:32,533 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:32,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 167 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-01-10 03:25:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-10 03:25:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-01-10 03:25:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 65 states have internal predecessors, (81), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:25:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2022-01-10 03:25:32,553 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 28 [2022-01-10 03:25:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:32,553 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2022-01-10 03:25:32,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:25:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-01-10 03:25:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 03:25:32,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:32,554 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:32,561 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 03:25:32,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:32,755 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -407057303, now seen corresponding path program 1 times [2022-01-10 03:25:32,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40200861] [2022-01-10 03:25:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:32,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:32,758 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:32,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:25:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:32,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 03:25:32,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:25:33,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 03:25:34,067 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:34,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40200861] [2022-01-10 03:25:34,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40200861] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:34,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:34,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2022-01-10 03:25:34,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599624487] [2022-01-10 03:25:34,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:34,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:25:34,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:25:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:25:34,075 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 03:25:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:35,078 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-01-10 03:25:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 03:25:35,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2022-01-10 03:25:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:35,083 INFO L225 Difference]: With dead ends: 100 [2022-01-10 03:25:35,083 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 03:25:35,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-01-10 03:25:35,084 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:35,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 123 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 03:25:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 03:25:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-01-10 03:25:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.171875) internal successors, (75), 65 states have internal predecessors, (75), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:25:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-01-10 03:25:35,100 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 34 [2022-01-10 03:25:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:35,100 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-01-10 03:25:35,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 03:25:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-01-10 03:25:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 03:25:35,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:35,103 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:35,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:35,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:35,312 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1487344618, now seen corresponding path program 1 times [2022-01-10 03:25:35,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:35,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883288615] [2022-01-10 03:25:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:35,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:35,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:35,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:35,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:25:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:35,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:25:35,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 03:25:35,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:36,219 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:36,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883288615] [2022-01-10 03:25:36,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883288615] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:25:36,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1355345854] [2022-01-10 03:25:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:36,220 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:25:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:25:36,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:25:36,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-01-10 03:25:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:36,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:25:36,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 03:25:36,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:36,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1355345854] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:25:36,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:36,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2022-01-10 03:25:36,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522703006] [2022-01-10 03:25:36,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:36,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 03:25:36,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 03:25:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-01-10 03:25:36,857 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-10 03:25:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:37,143 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-01-10 03:25:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:25:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2022-01-10 03:25:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:37,146 INFO L225 Difference]: With dead ends: 86 [2022-01-10 03:25:37,146 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 03:25:37,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-10 03:25:37,146 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:37,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 167 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:25:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 03:25:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-01-10 03:25:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:25:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2022-01-10 03:25:37,163 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 37 [2022-01-10 03:25:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:37,163 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2022-01-10 03:25:37,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-10 03:25:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2022-01-10 03:25:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:25:37,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:37,170 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:37,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:37,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 03:25:37,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:37,579 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1736881443, now seen corresponding path program 1 times [2022-01-10 03:25:37,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:37,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807454482] [2022-01-10 03:25:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:25:37,580 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:37,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:37,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:25:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:25:37,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:25:37,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:25:37,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:25:37,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:37,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807454482] [2022-01-10 03:25:37,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807454482] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:37,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:37,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-01-10 03:25:37,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132452183] [2022-01-10 03:25:37,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:37,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:25:37,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:25:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:25:37,826 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 03:25:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:37,857 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2022-01-10 03:25:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:25:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2022-01-10 03:25:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:37,859 INFO L225 Difference]: With dead ends: 128 [2022-01-10 03:25:37,859 INFO L226 Difference]: Without dead ends: 105 [2022-01-10 03:25:37,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:25:37,860 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:37,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:25:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-10 03:25:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2022-01-10 03:25:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 80 states have internal predecessors, (90), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-10 03:25:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2022-01-10 03:25:37,868 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 46 [2022-01-10 03:25:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:37,869 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2022-01-10 03:25:37,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 03:25:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-01-10 03:25:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:25:37,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:37,869 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:37,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-01-10 03:25:38,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:38,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 102422691, now seen corresponding path program 2 times [2022-01-10 03:25:38,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151754656] [2022-01-10 03:25:38,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:25:38,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:38,082 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:38,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 03:25:38,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:25:38,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:25:38,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:25:38,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:25:38,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:25:38,345 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151754656] [2022-01-10 03:25:38,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151754656] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:38,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:38,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-01-10 03:25:38,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456010577] [2022-01-10 03:25:38,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:38,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:25:38,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:25:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:25:38,346 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 03:25:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:38,384 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2022-01-10 03:25:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:25:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2022-01-10 03:25:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:38,386 INFO L225 Difference]: With dead ends: 115 [2022-01-10 03:25:38,386 INFO L226 Difference]: Without dead ends: 101 [2022-01-10 03:25:38,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:25:38,387 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:38,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:25:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-10 03:25:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-01-10 03:25:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.131578947368421) internal successors, (86), 78 states have internal predecessors, (86), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-10 03:25:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2022-01-10 03:25:38,395 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 46 [2022-01-10 03:25:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:38,395 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2022-01-10 03:25:38,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 03:25:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2022-01-10 03:25:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:25:38,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:38,396 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:38,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:38,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:38,607 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -918645663, now seen corresponding path program 3 times [2022-01-10 03:25:38,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:38,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510455256] [2022-01-10 03:25:38,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:25:38,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:38,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:38,608 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:38,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 03:25:38,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:25:38,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:25:38,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 03:25:38,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 03:25:39,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 03:25:45,280 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:45,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510455256] [2022-01-10 03:25:45,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510455256] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:45,280 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:45,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2022-01-10 03:25:45,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753109967] [2022-01-10 03:25:45,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:45,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 03:25:45,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 03:25:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-01-10 03:25:45,281 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:25:48,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:25:56,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:25:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:56,110 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-01-10 03:25:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 03:25:56,112 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 46 [2022-01-10 03:25:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:56,113 INFO L225 Difference]: With dead ends: 126 [2022-01-10 03:25:56,113 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 03:25:56,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=112, Invalid=487, Unknown=1, NotChecked=0, Total=600 [2022-01-10 03:25:56,114 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:56,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-01-10 03:25:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 03:25:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2022-01-10 03:25:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 96 states have internal predecessors, (106), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-10 03:25:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2022-01-10 03:25:56,132 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 46 [2022-01-10 03:25:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:56,132 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2022-01-10 03:25:56,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:25:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2022-01-10 03:25:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 03:25:56,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:56,133 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:56,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 03:25:56,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:56,341 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-01-10 03:25:56,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:56,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687056353] [2022-01-10 03:25:56,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:25:56,341 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:56,342 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:56,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 03:25:56,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:25:56,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:25:56,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 03:25:56,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:25:56,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:25:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-10 03:25:56,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:25:56,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687056353] [2022-01-10 03:25:56,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687056353] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:25:56,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:25:56,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-01-10 03:25:56,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719295393] [2022-01-10 03:25:56,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:25:56,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 03:25:56,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:25:56,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 03:25:56,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:25:56,751 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-01-10 03:25:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:25:57,458 INFO L93 Difference]: Finished difference Result 382 states and 480 transitions. [2022-01-10 03:25:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 03:25:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2022-01-10 03:25:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:25:57,461 INFO L225 Difference]: With dead ends: 382 [2022-01-10 03:25:57,461 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 03:25:57,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2022-01-10 03:25:57,462 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 192 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:25:57,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 279 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 03:25:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 03:25:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2022-01-10 03:25:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 287 states have (on average 1.1219512195121952) internal successors, (322), 293 states have internal predecessors, (322), 54 states have call successors, (54), 25 states have call predecessors, (54), 25 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-01-10 03:25:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 429 transitions. [2022-01-10 03:25:57,489 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 429 transitions. Word has length 55 [2022-01-10 03:25:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:25:57,489 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 429 transitions. [2022-01-10 03:25:57,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-01-10 03:25:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 429 transitions. [2022-01-10 03:25:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-10 03:25:57,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:25:57,503 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:25:57,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-01-10 03:25:57,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:25:57,712 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:25:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:25:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 408806471, now seen corresponding path program 4 times [2022-01-10 03:25:57,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:25:57,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598478744] [2022-01-10 03:25:57,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:25:57,713 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:25:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:25:57,714 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:25:57,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 03:25:57,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:25:57,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:25:57,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 03:25:57,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:25:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 23 proven. 73 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 03:25:59,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:26:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-01-10 03:26:00,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:26:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598478744] [2022-01-10 03:26:00,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598478744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:26:00,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:26:00,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 23 [2022-01-10 03:26:00,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710323359] [2022-01-10 03:26:00,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:26:00,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 03:26:00,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:26:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 03:26:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-01-10 03:26:00,850 INFO L87 Difference]: Start difference. First operand 367 states and 429 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-01-10 03:26:03,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:26:05,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:26:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:26:05,940 INFO L93 Difference]: Finished difference Result 504 states and 569 transitions. [2022-01-10 03:26:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 03:26:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 64 [2022-01-10 03:26:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:26:05,942 INFO L225 Difference]: With dead ends: 504 [2022-01-10 03:26:05,942 INFO L226 Difference]: Without dead ends: 358 [2022-01-10 03:26:05,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2022-01-10 03:26:05,944 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:26:05,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 311 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-01-10 03:26:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-01-10 03:26:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 290. [2022-01-10 03:26:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.0666666666666667) internal successors, (240), 228 states have internal predecessors, (240), 39 states have call successors, (39), 26 states have call predecessors, (39), 25 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-10 03:26:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2022-01-10 03:26:05,966 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 64 [2022-01-10 03:26:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:26:05,966 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2022-01-10 03:26:05,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-01-10 03:26:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2022-01-10 03:26:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 03:26:05,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:26:05,968 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:26:05,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-01-10 03:26:06,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:26:06,175 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:26:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:26:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-01-10 03:26:06,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:26:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534243949] [2022-01-10 03:26:06,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:26:06,177 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:26:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:26:06,177 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:26:06,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 03:26:06,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-10 03:26:06,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 03:26:06,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 03:26:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:26:06,943 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 03:26:06,943 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 03:26:06,944 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:26:06,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 03:26:07,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:26:07,174 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:26:07,176 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:26:07,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:26:07 BoogieIcfgContainer [2022-01-10 03:26:07,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:26:07,214 INFO L158 Benchmark]: Toolchain (without parser) took 47602.90ms. Allocated memory was 212.9MB in the beginning and 263.2MB in the end (delta: 50.3MB). Free memory was 160.1MB in the beginning and 116.7MB in the end (delta: 43.4MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,214 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 212.9MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:26:07,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.91ms. Allocated memory is still 212.9MB. Free memory was 159.9MB in the beginning and 186.9MB in the end (delta: -26.9MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.71ms. Allocated memory is still 212.9MB. Free memory was 186.9MB in the beginning and 185.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,214 INFO L158 Benchmark]: Boogie Preprocessor took 13.97ms. Allocated memory is still 212.9MB. Free memory was 185.1MB in the beginning and 184.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,215 INFO L158 Benchmark]: RCFGBuilder took 230.64ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 173.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,215 INFO L158 Benchmark]: TraceAbstraction took 47142.83ms. Allocated memory was 212.9MB in the beginning and 263.2MB in the end (delta: 50.3MB). Free memory was 173.3MB in the beginning and 116.7MB in the end (delta: 56.5MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. [2022-01-10 03:26:07,216 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.15ms. Allocated memory is still 212.9MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.91ms. Allocated memory is still 212.9MB. Free memory was 159.9MB in the beginning and 186.9MB in the end (delta: -26.9MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.71ms. Allocated memory is still 212.9MB. Free memory was 186.9MB in the beginning and 185.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.97ms. Allocated memory is still 212.9MB. Free memory was 185.1MB in the beginning and 184.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 230.64ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 173.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 47142.83ms. Allocated memory was 212.9MB in the beginning and 263.2MB in the end (delta: 50.3MB). Free memory was 173.3MB in the beginning and 116.7MB in the end (delta: 56.5MB). Peak memory consumption was 108.4MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=1073741824] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=1073741824, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=1073741824, x2=1, y1=6, y2=0, y3=1073741818] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=1073741824, x2=1, y1=7, y2=0, y3=1073741817] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=1073741824, x2=1, y1=8, y2=0, y3=1073741816] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=1073741824, x2=1, y1=9, y2=0, y3=1073741815] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=1073741824, x2=1, y1=10, y2=0, y3=1073741814] [L36] COND FALSE !(counter++<10) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=11] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 1779 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 1440 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1282 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 339 mSDtfsCounter, 1282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 946 GetRequests, 766 SyntacticMatches, 4 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=12, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 636 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 869 ConstructedInterpolants, 3 QuantifiedInterpolants, 3762 SizeOfPredicates, 36 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 24 InterpolantComputations, 4 PerfectInterpolantSequences, 524/802 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 03:26:07,249 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...