/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/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:00:56,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:00:56,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:00:56,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:00:56,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:00:56,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:00:56,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:00:56,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:00:56,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:00:56,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:00:56,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:00:56,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:00:56,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:00:56,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:00:56,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:00:56,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:00:56,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:00:56,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:00:56,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:00:56,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:00:56,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:00:56,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:00:56,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:00:56,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:00:56,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:00:56,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:00:56,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:00:56,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:00:56,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:00:56,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:00:56,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:00:56,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:00:56,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:00:56,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:00:56,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:00:56,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:00:56,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:00:56,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:00:56,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:00:56,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:00:56,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:00:56,907 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:00:56,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:00:56,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:00:56,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:00:56,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:00:56,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:00:56,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:00:56,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:00:56,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:00:56,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:00:56,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:00:56,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:00:56,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:00:56,923 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:00:56,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:00:56,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:00:56,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:00:56,924 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:00:57,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:00:57,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:00:57,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:00:57,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:00:57,081 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:00:57,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-01-10 03:00:57,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19031535/83da44fff0614725be5f677c992cc36e/FLAG59d7dc570 [2022-01-10 03:00:57,439 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:00:57,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-01-10 03:00:57,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19031535/83da44fff0614725be5f677c992cc36e/FLAG59d7dc570 [2022-01-10 03:00:57,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19031535/83da44fff0614725be5f677c992cc36e [2022-01-10 03:00:57,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:00:57,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:00:57,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:00:57,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:00:57,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:00:57,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:00:57" (1/1) ... [2022-01-10 03:00:57,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50975e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:57, skipping insertion in model container [2022-01-10 03:00:57,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:00:57" (1/1) ... [2022-01-10 03:00:57,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:00:57,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:00:58,063 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/cohencu-ll_unwindbound2.c[588,601] [2022-01-10 03:00:58,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:00:58,110 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:00:58,123 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/cohencu-ll_unwindbound2.c[588,601] [2022-01-10 03:00:58,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:00:58,152 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:00:58,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58 WrapperNode [2022-01-10 03:00:58,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:00:58,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:00:58,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:00:58,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:00:58,159 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:00:58" (1/1) ... [2022-01-10 03:00:58,170 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:00:58" (1/1) ... [2022-01-10 03:00:58,189 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-01-10 03:00:58,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:00:58,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:00:58,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:00:58,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:00:58,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:00:58,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:00:58,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:00:58,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:00:58,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (1/1) ... [2022-01-10 03:00:58,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:00:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:00:58,293 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:00:58,308 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:00:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:00:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:00:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:00:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:00:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:00:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:00:58,368 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:00:58,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:00:58,529 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:00:58,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:00:58,533 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:00:58,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:00:58 BoogieIcfgContainer [2022-01-10 03:00:58,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:00:58,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:00:58,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:00:58,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:00:58,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:00:57" (1/3) ... [2022-01-10 03:00:58,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2452b868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:00:58, skipping insertion in model container [2022-01-10 03:00:58,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:58" (2/3) ... [2022-01-10 03:00:58,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2452b868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:00:58, skipping insertion in model container [2022-01-10 03:00:58,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:00:58" (3/3) ... [2022-01-10 03:00:58,552 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2022-01-10 03:00:58,555 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:00:58,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:00:58,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:00:58,617 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:00:58,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:00:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:00:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 03:00:58,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:58,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:58,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-01-10 03:00:58,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:58,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430211405] [2022-01-10 03:00:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:58,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:58,652 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:00:58,694 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:00:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:58,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:00:58,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:00:58,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:58,763 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430211405] [2022-01-10 03:00:58,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430211405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:58,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:58,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:00:58,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646513642] [2022-01-10 03:00:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:58,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:00:58,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:00:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:00:58,793 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:00:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:58,813 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-01-10 03:00:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:00:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-01-10 03:00:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:58,820 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:00:58,820 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 03:00:58,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:00:58,825 INFO L933 BasicCegarLoop]: 37 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, 37 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:00:58,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:00:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 03:00:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 03:00:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:00:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-01-10 03:00:58,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-01-10 03:00:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:58,858 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-01-10 03:00:58,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:00:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-01-10 03:00:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:00:58,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:58,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:58,877 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:00:59,066 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:00:59,067 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-01-10 03:00:59,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:59,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99766667] [2022-01-10 03:00:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:59,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:59,071 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:00:59,073 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:00:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:59,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:00:59,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:00:59,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:59,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99766667] [2022-01-10 03:00:59,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99766667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:59,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:59,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:00:59,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754801892] [2022-01-10 03:00:59,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:59,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:00:59,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:00:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:00:59,145 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:00:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:59,175 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-01-10 03:00:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:00:59,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 03:00:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:59,176 INFO L225 Difference]: With dead ends: 36 [2022-01-10 03:00:59,176 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 03:00:59,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:00:59,177 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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:00:59,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:00:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 03:00:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 03:00:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:00:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-01-10 03:00:59,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-01-10 03:00:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:59,183 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-01-10 03:00:59,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:00:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-01-10 03:00:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:00:59,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:59,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:59,197 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:00:59,399 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:00:59,400 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-01-10 03:00:59,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122350658] [2022-01-10 03:00:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:59,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:59,402 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:00:59,404 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:00:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:59,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:00:59,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:00:59,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:59,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122350658] [2022-01-10 03:00:59,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122350658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:59,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:59,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:00:59,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029471820] [2022-01-10 03:00:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:59,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:00:59,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:00:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:00:59,508 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:00,435 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2022-01-10 03:01:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 03:01:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:00,449 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:01:00,449 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:01:00,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:00,450 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:00,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 137 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:01:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:01:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-10 03:01:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:01:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-01-10 03:01:00,469 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 8 [2022-01-10 03:01:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:00,470 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-01-10 03:01:00,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-01-10 03:01:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:01:00,470 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:00,470 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:00,477 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:01:00,674 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:01:00,675 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-01-10 03:01:00,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039979281] [2022-01-10 03:01:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:00,676 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:00,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:00,679 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:01:00,680 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:01:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:00,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:00,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:01:00,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:00,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:00,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039979281] [2022-01-10 03:01:00,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039979281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:00,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:00,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:00,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132411207] [2022-01-10 03:01:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:00,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:00,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:00,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:00,873 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:01:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:01,714 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-01-10 03:01:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-01-10 03:01:01,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:01,716 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:01:01,716 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 03:01:01,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:01,717 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:01,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 03:01:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 03:01:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-01-10 03:01:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:01:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2022-01-10 03:01:01,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 13 [2022-01-10 03:01:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:01,728 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2022-01-10 03:01:01,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:01:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2022-01-10 03:01:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:01:01,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:01,729 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:01,736 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:01:01,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:01,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-01-10 03:01:01,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480357121] [2022-01-10 03:01:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:01,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:01,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:01,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:01,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:01:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:02,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:02,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:01:02,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:02,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480357121] [2022-01-10 03:01:02,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480357121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:02,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:02,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:02,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129536031] [2022-01-10 03:01:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:02,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:02,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:02,165 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:01:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:03,244 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-01-10 03:01:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:01:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:03,256 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:01:03,256 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 03:01:03,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:03,257 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:03,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 03:01:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 03:01:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-01-10 03:01:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-10 03:01:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-01-10 03:01:03,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-01-10 03:01:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:03,263 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-01-10 03:01:03,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:01:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-01-10 03:01:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 03:01:03,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:03,264 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:03,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:03,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:03,484 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-01-10 03:01:03,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:03,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031567287] [2022-01-10 03:01:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:03,486 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:03,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:03,487 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:01:03,488 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:01:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:03,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:01:03,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:01:03,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:03,760 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031567287] [2022-01-10 03:01:03,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031567287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:03,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:03,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:03,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872276727] [2022-01-10 03:01:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:03,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:03,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:03,761 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:01:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:05,349 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-01-10 03:01:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:05,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-01-10 03:01:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:05,361 INFO L225 Difference]: With dead ends: 58 [2022-01-10 03:01:05,361 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:01:05,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:05,362 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:05,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 03:01:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:01:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 03:01:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:01:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-01-10 03:01:05,368 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-01-10 03:01:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:05,368 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-01-10 03:01:05,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:01:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-01-10 03:01:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:01:05,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:05,369 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:05,379 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:01:05,570 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:01:05,570 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1618699309, now seen corresponding path program 1 times [2022-01-10 03:01:05,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:05,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813195255] [2022-01-10 03:01:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:05,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:05,572 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:01:05,573 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:01:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:05,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:05,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:01:05,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:01:06,026 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:06,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813195255] [2022-01-10 03:01:06,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813195255] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:06,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:06,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-01-10 03:01:06,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127133594] [2022-01-10 03:01:06,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:06,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:01:06,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:06,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:01:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:01:06,028 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:01:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:06,971 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-01-10 03:01:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:01:06,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 36 [2022-01-10 03:01:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:06,972 INFO L225 Difference]: With dead ends: 60 [2022-01-10 03:01:06,972 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 03:01:06,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:01:06,973 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:06,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:01:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 03:01:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 03:01:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:01:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-10 03:01:06,980 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 36 [2022-01-10 03:01:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:06,981 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-10 03:01:06,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:01:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-10 03:01:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:01:06,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:06,982 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:07,003 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:01:07,187 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:01:07,187 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1620248441, now seen corresponding path program 1 times [2022-01-10 03:01:07,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949732576] [2022-01-10 03:01:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:07,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:07,190 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:01:07,191 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:01:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:07,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:01:07,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:01:07,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-10 03:01:07,846 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949732576] [2022-01-10 03:01:07,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949732576] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:01:07,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:01:07,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-01-10 03:01:07,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523079823] [2022-01-10 03:01:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:07,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:07,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:01:07,847 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:08,775 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-01-10 03:01:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:01:08,785 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), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-01-10 03:01:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:08,786 INFO L225 Difference]: With dead ends: 54 [2022-01-10 03:01:08,786 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 03:01:08,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:08,787 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:08,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:01:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 03:01:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-01-10 03:01:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:01:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-01-10 03:01:08,793 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 36 [2022-01-10 03:01:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:08,793 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-01-10 03:01:08,793 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), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-01-10 03:01:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:01:08,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:08,794 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:08,817 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:01:09,006 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:01:09,007 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 2 times [2022-01-10 03:01:09,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:09,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785517173] [2022-01-10 03:01:09,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:01:09,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:09,009 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:01:09,072 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:01:09,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:01:09,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:09,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:09,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:09,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:13,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:13,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785517173] [2022-01-10 03:01:13,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785517173] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:13,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:13,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:13,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764977451] [2022-01-10 03:01:13,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:13,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:13,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:13,081 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:17,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:19,556 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:01:21,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:23,610 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:01:28,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:30,023 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:01:32,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:34,113 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:01:36,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:40,658 INFO L93 Difference]: Finished difference Result 106 states and 149 transitions. [2022-01-10 03:01:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:01:40,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-01-10 03:01:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:40,669 INFO L225 Difference]: With dead ends: 106 [2022-01-10 03:01:40,669 INFO L226 Difference]: Without dead ends: 104 [2022-01-10 03:01:40,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:01:40,670 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 45 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:40,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 340 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 174 Invalid, 9 Unknown, 0 Unchecked, 26.3s Time] [2022-01-10 03:01:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-10 03:01:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2022-01-10 03:01:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 33 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-10 03:01:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2022-01-10 03:01:40,685 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 41 [2022-01-10 03:01:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:40,685 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2022-01-10 03:01:40,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2022-01-10 03:01:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:01:40,686 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:40,686 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:40,698 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:01:40,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:40,899 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 3 times [2022-01-10 03:01:40,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:40,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821194472] [2022-01-10 03:01:40,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:01:40,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:40,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:40,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:40,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:01:40,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:01:40,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:40,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:40,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:01:41,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:01:49,683 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:49,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821194472] [2022-01-10 03:01:49,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821194472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:49,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:49,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:49,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049884295] [2022-01-10 03:01:49,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:49,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:49,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:49,685 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:01:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:54,216 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2022-01-10 03:01:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:01:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-01-10 03:01:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:54,231 INFO L225 Difference]: With dead ends: 94 [2022-01-10 03:01:54,231 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 03:01:54,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:01:54,231 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:54,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 350 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-01-10 03:01:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 03:01:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-01-10 03:01:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-10 03:01:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2022-01-10 03:01:54,246 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 46 [2022-01-10 03:01:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:54,246 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2022-01-10 03:01:54,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:01:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2022-01-10 03:01:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:01:54,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:54,247 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:54,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:54,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:54,448 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 4 times [2022-01-10 03:01:54,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363315244] [2022-01-10 03:01:54,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:01:54,449 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:54,450 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:01:54,451 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:01:54,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:01:54,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:54,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:01:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:01:55,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:02:04,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:04,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363315244] [2022-01-10 03:02:04,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363315244] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:02:04,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:02:04,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:02:04,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687147008] [2022-01-10 03:02:04,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:02:04,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:02:04,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:04,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:02:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:04,091 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-01-10 03:02:19,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []