/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/bitvector/soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:40:28,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:40:28,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:40:28,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:40:28,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:40:28,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:40:28,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:40:28,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:40:28,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:40:28,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:40:28,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:40:28,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:40:28,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:40:28,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:40:28,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:40:28,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:40:28,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:40:28,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:40:28,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:40:28,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:40:28,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:40:28,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:40:28,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:40:28,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:40:28,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:40:28,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:40:28,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:40:28,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:40:28,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:40:28,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:40:28,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:40:28,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:40:28,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:40:28,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:40:28,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:40:28,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:40:28,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:40:28,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:40:28,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:40:28,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:40:28,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:40:28,494 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 02:40:28,517 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:40:28,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:40:28,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:40:28,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:40:28,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:40:28,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:40:28,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:40:28,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:40:28,525 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:40:28,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:40:28,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:40:28,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:40:28,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:40:28,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:40:28,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:40:28,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:40:28,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:28,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:40:28,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:40:28,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:40:28,529 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:40:28,529 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:28,529 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:40:28,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:40:28,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:40:28,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:40:28,530 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 02:40:28,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:40:28,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:40:28,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:40:28,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:40:28,744 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:40:28,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2022-01-10 02:40:28,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f66cb01/d608148ecb52457d85a3840d5229079f/FLAGaa9b55631 [2022-01-10 02:40:29,118 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:40:29,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2022-01-10 02:40:29,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f66cb01/d608148ecb52457d85a3840d5229079f/FLAGaa9b55631 [2022-01-10 02:40:29,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f66cb01/d608148ecb52457d85a3840d5229079f [2022-01-10 02:40:29,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:40:29,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:40:29,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:29,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:40:29,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:40:29,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edbca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29, skipping insertion in model container [2022-01-10 02:40:29,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:40:29,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:40:29,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2022-01-10 02:40:29,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:29,757 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:40:29,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2022-01-10 02:40:29,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:29,798 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:40:29,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29 WrapperNode [2022-01-10 02:40:29,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:29,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:29,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:40:29,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:40:29,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,826 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-01-10 02:40:29,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:29,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:40:29,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:40:29,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:40:29,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:40:29,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:40:29,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:40:29,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:40:29,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (1/1) ... [2022-01-10 02:40:29,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:40:29,875 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 02:40:29,891 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 02:40:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:40:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:40:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-01-10 02:40:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-01-10 02:40:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:40:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:40:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 02:40:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 02:40:29,959 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:40:29,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:40:30,176 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:40:30,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:40:30,188 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 02:40:30,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:30 BoogieIcfgContainer [2022-01-10 02:40:30,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:40:30,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:40:30,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:40:30,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:40:30,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:29" (1/3) ... [2022-01-10 02:40:30,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e51474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:30, skipping insertion in model container [2022-01-10 02:40:30,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:29" (2/3) ... [2022-01-10 02:40:30,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e51474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:30, skipping insertion in model container [2022-01-10 02:40:30,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:30" (3/3) ... [2022-01-10 02:40:30,197 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2022-01-10 02:40:30,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:40:30,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:40:30,234 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:40:30,240 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 02:40:30,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:40:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 02:40:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 02:40:30,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:30,259 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:30,259 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1428146956, now seen corresponding path program 1 times [2022-01-10 02:40:30,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:30,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706551659] [2022-01-10 02:40:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:30,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:30,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:30,279 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 02:40:30,295 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 02:40:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:30,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:30,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:30,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:30,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:30,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706551659] [2022-01-10 02:40:30,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706551659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:30,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:30,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:30,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920400300] [2022-01-10 02:40:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:30,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:30,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:30,619 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:30,732 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2022-01-10 02:40:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-10 02:40:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:30,746 INFO L225 Difference]: With dead ends: 115 [2022-01-10 02:40:30,747 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 02:40:30,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:30,752 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:30,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 02:40:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-01-10 02:40:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 02:40:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-01-10 02:40:30,793 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 42 [2022-01-10 02:40:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:30,793 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-01-10 02:40:30,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-01-10 02:40:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 02:40:30,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:30,795 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:30,807 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 02:40:31,007 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 02:40:31,007 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -649725496, now seen corresponding path program 1 times [2022-01-10 02:40:31,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:31,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087158870] [2022-01-10 02:40:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:31,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:31,010 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 02:40:31,012 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 02:40:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:31,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:31,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:31,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:31,183 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:31,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087158870] [2022-01-10 02:40:31,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087158870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:31,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:31,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:31,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997327022] [2022-01-10 02:40:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:31,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:31,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:31,186 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:31,253 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-01-10 02:40:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:40:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-01-10 02:40:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:31,257 INFO L225 Difference]: With dead ends: 107 [2022-01-10 02:40:31,257 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 02:40:31,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:31,259 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:31,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 157 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 02:40:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-01-10 02:40:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-01-10 02:40:31,272 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2022-01-10 02:40:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:31,272 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-01-10 02:40:31,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-01-10 02:40:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 02:40:31,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:31,274 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:31,284 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 02:40:31,483 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 02:40:31,483 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 996548609, now seen corresponding path program 1 times [2022-01-10 02:40:31,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:31,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283976630] [2022-01-10 02:40:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:31,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:31,486 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 02:40:31,488 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 02:40:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:31,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:31,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:31,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:31,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:31,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283976630] [2022-01-10 02:40:31,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283976630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:31,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:31,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:31,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415052216] [2022-01-10 02:40:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:31,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:31,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:31,630 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:31,699 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-01-10 02:40:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-10 02:40:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:31,703 INFO L225 Difference]: With dead ends: 116 [2022-01-10 02:40:31,703 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 02:40:31,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:31,709 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:31,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 150 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 02:40:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2022-01-10 02:40:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-01-10 02:40:31,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 46 [2022-01-10 02:40:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:31,725 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-01-10 02:40:31,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-01-10 02:40:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 02:40:31,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:31,727 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:31,737 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 02:40:31,935 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 02:40:31,935 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1306691689, now seen corresponding path program 1 times [2022-01-10 02:40:31,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:31,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721819861] [2022-01-10 02:40:31,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:31,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:31,939 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 02:40:31,941 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 02:40:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:31,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:31,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:32,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:32,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721819861] [2022-01-10 02:40:32,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721819861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:32,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:32,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:40:32,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275025235] [2022-01-10 02:40:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:32,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:40:32,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:32,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:40:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:32,093 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:32,193 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2022-01-10 02:40:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:40:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-01-10 02:40:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:32,195 INFO L225 Difference]: With dead ends: 124 [2022-01-10 02:40:32,195 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 02:40:32,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:32,196 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:32,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 198 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 02:40:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2022-01-10 02:40:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2022-01-10 02:40:32,204 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 47 [2022-01-10 02:40:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:32,204 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-01-10 02:40:32,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2022-01-10 02:40:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 02:40:32,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:32,206 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:32,213 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 02:40:32,411 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 02:40:32,411 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash 164215198, now seen corresponding path program 1 times [2022-01-10 02:40:32,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:32,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76186234] [2022-01-10 02:40:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:32,413 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:32,414 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 02:40:32,416 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 02:40:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:32,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:32,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:32,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:32,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76186234] [2022-01-10 02:40:32,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76186234] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:32,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:32,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:40:32,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872747872] [2022-01-10 02:40:32,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:32,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:40:32,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:40:32,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:32,856 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:33,062 INFO L93 Difference]: Finished difference Result 145 states and 207 transitions. [2022-01-10 02:40:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:40:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2022-01-10 02:40:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:33,065 INFO L225 Difference]: With dead ends: 145 [2022-01-10 02:40:33,065 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 02:40:33,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:40:33,067 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:33,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 271 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 02:40:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-01-10 02:40:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2022-01-10 02:40:33,077 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 48 [2022-01-10 02:40:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:33,077 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2022-01-10 02:40:33,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2022-01-10 02:40:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 02:40:33,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:33,079 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:33,090 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 02:40:33,287 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 02:40:33,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650751, now seen corresponding path program 1 times [2022-01-10 02:40:33,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768072280] [2022-01-10 02:40:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:33,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:33,290 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 02:40:33,291 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 02:40:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:33,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:33,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:33,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:33,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768072280] [2022-01-10 02:40:33,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768072280] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:33,632 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:33,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 02:40:33,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412641867] [2022-01-10 02:40:33,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:33,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:40:33,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:40:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:40:33,634 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:33,869 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2022-01-10 02:40:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:40:33,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-01-10 02:40:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:33,871 INFO L225 Difference]: With dead ends: 163 [2022-01-10 02:40:33,871 INFO L226 Difference]: Without dead ends: 104 [2022-01-10 02:40:33,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:40:33,872 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 102 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:33,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 324 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-10 02:40:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2022-01-10 02:40:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2022-01-10 02:40:33,882 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 50 [2022-01-10 02:40:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:33,882 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2022-01-10 02:40:33,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-01-10 02:40:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:40:33,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:33,883 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:33,894 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 02:40:34,091 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 02:40:34,092 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -231695800, now seen corresponding path program 2 times [2022-01-10 02:40:34,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:34,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804786088] [2022-01-10 02:40:34,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:34,093 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:34,094 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 02:40:34,094 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 02:40:34,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:34,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:34,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:40:34,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 02:40:34,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:34,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:34,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804786088] [2022-01-10 02:40:34,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804786088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:34,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:34,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:40:34,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786818972] [2022-01-10 02:40:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:34,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:40:34,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:40:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:34,240 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:34,303 INFO L93 Difference]: Finished difference Result 118 states and 168 transitions. [2022-01-10 02:40:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:40:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-01-10 02:40:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:34,308 INFO L225 Difference]: With dead ends: 118 [2022-01-10 02:40:34,309 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 02:40:34,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:40:34,310 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 34 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:34,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 334 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 02:40:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2022-01-10 02:40:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 74 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2022-01-10 02:40:34,318 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 57 [2022-01-10 02:40:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:34,319 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2022-01-10 02:40:34,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2022-01-10 02:40:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:40:34,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:34,320 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:34,331 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 02:40:34,528 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 02:40:34,529 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash -624722810, now seen corresponding path program 1 times [2022-01-10 02:40:34,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:34,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665591030] [2022-01-10 02:40:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:34,530 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:34,531 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 02:40:34,533 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 02:40:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:34,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:40:34,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:34,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:35,095 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665591030] [2022-01-10 02:40:35,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665591030] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:35,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:35,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-01-10 02:40:35,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541704045] [2022-01-10 02:40:35,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:35,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:40:35,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:40:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:40:35,097 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:35,825 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2022-01-10 02:40:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 02:40:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2022-01-10 02:40:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:35,827 INFO L225 Difference]: With dead ends: 230 [2022-01-10 02:40:35,827 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 02:40:35,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:40:35,829 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 172 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:35,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 574 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:40:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 02:40:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2022-01-10 02:40:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.430232558139535) internal successors, (123), 88 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2022-01-10 02:40:35,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 57 [2022-01-10 02:40:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:35,843 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2022-01-10 02:40:35,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2022-01-10 02:40:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 02:40:35,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:35,844 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:35,859 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 02:40:36,054 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 02:40:36,055 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 539901053, now seen corresponding path program 1 times [2022-01-10 02:40:36,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751121596] [2022-01-10 02:40:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:36,056 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:36,056 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 02:40:36,057 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 02:40:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:36,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:40:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:36,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:36,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751121596] [2022-01-10 02:40:36,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751121596] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:36,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:36,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-01-10 02:40:36,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539614223] [2022-01-10 02:40:36,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:36,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 02:40:36,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 02:40:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:40:36,614 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:37,273 INFO L93 Difference]: Finished difference Result 253 states and 367 transitions. [2022-01-10 02:40:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 02:40:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-01-10 02:40:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:37,275 INFO L225 Difference]: With dead ends: 253 [2022-01-10 02:40:37,275 INFO L226 Difference]: Without dead ends: 163 [2022-01-10 02:40:37,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2022-01-10 02:40:37,276 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 393 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:37,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 616 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:40:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-10 02:40:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2022-01-10 02:40:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 98 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2022-01-10 02:40:37,288 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 62 [2022-01-10 02:40:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:37,288 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2022-01-10 02:40:37,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2022-01-10 02:40:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 02:40:37,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:37,290 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:37,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:37,498 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 02:40:37,498 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 74548550, now seen corresponding path program 2 times [2022-01-10 02:40:37,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:37,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441389959] [2022-01-10 02:40:37,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:37,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:37,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:37,500 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 02:40:37,502 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 02:40:37,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:37,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:37,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:37,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-01-10 02:40:37,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:37,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:37,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441389959] [2022-01-10 02:40:37,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441389959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:37,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:37,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:37,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427202712] [2022-01-10 02:40:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:37,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:37,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:37,633 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:37,646 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2022-01-10 02:40:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:37,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-01-10 02:40:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:37,650 INFO L225 Difference]: With dead ends: 130 [2022-01-10 02:40:37,651 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 02:40:37,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:37,651 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:37,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 02:40:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-10 02:40:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4375) internal successors, (138), 98 states have internal predecessors, (138), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2022-01-10 02:40:37,660 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 75 [2022-01-10 02:40:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:37,660 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2022-01-10 02:40:37,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2022-01-10 02:40:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:40:37,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:37,661 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:37,667 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 02:40:37,863 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 02:40:37,863 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash 927712034, now seen corresponding path program 1 times [2022-01-10 02:40:37,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:37,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373308418] [2022-01-10 02:40:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:37,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:37,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:37,865 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 02:40:37,867 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 02:40:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:37,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 02:40:37,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:38,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:39,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373308418] [2022-01-10 02:40:39,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373308418] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:39,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:39,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-01-10 02:40:39,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820932628] [2022-01-10 02:40:39,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:39,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 02:40:39,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 02:40:39,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-01-10 02:40:39,176 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:42,055 INFO L93 Difference]: Finished difference Result 356 states and 513 transitions. [2022-01-10 02:40:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-10 02:40:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-01-10 02:40:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:42,058 INFO L225 Difference]: With dead ends: 356 [2022-01-10 02:40:42,058 INFO L226 Difference]: Without dead ends: 256 [2022-01-10 02:40:42,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 02:40:42,060 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 579 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:42,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 1561 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:40:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-10 02:40:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 133. [2022-01-10 02:40:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 122 states have (on average 1.4836065573770492) internal successors, (181), 124 states have internal predecessors, (181), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 199 transitions. [2022-01-10 02:40:42,077 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 199 transitions. Word has length 77 [2022-01-10 02:40:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:42,077 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 199 transitions. [2022-01-10 02:40:42,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 199 transitions. [2022-01-10 02:40:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 02:40:42,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:42,078 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:42,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:42,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:42,287 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1303025767, now seen corresponding path program 1 times [2022-01-10 02:40:42,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915972950] [2022-01-10 02:40:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:42,288 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:42,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:42,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:40:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:42,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 02:40:42,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:42,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:43,480 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915972950] [2022-01-10 02:40:43,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915972950] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:43,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:43,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-01-10 02:40:43,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785571689] [2022-01-10 02:40:43,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:43,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 02:40:43,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 02:40:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 02:40:43,482 INFO L87 Difference]: Start difference. First operand 133 states and 199 transitions. Second operand has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:45,057 INFO L93 Difference]: Finished difference Result 357 states and 519 transitions. [2022-01-10 02:40:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-10 02:40:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2022-01-10 02:40:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:45,067 INFO L225 Difference]: With dead ends: 357 [2022-01-10 02:40:45,067 INFO L226 Difference]: Without dead ends: 231 [2022-01-10 02:40:45,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2022-01-10 02:40:45,068 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 1007 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:45,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 1594 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:40:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-10 02:40:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 137. [2022-01-10 02:40:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.492063492063492) internal successors, (188), 128 states have internal predecessors, (188), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 206 transitions. [2022-01-10 02:40:45,082 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 206 transitions. Word has length 88 [2022-01-10 02:40:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:45,083 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 206 transitions. [2022-01-10 02:40:45,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 206 transitions. [2022-01-10 02:40:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 02:40:45,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:45,084 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:45,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:45,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:45,291 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 939484322, now seen corresponding path program 2 times [2022-01-10 02:40:45,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846667532] [2022-01-10 02:40:45,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:45,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:45,293 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:45,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 02:40:45,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:45,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:45,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:45,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2022-01-10 02:40:45,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:45,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846667532] [2022-01-10 02:40:45,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846667532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:45,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:45,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:40:45,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067666324] [2022-01-10 02:40:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:45,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:40:45,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:40:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:45,476 INFO L87 Difference]: Start difference. First operand 137 states and 206 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:45,524 INFO L93 Difference]: Finished difference Result 163 states and 241 transitions. [2022-01-10 02:40:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 113 [2022-01-10 02:40:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:45,526 INFO L225 Difference]: With dead ends: 163 [2022-01-10 02:40:45,526 INFO L226 Difference]: Without dead ends: 158 [2022-01-10 02:40:45,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:45,527 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:45,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-10 02:40:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2022-01-10 02:40:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 133 states have internal predecessors, (194), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2022-01-10 02:40:45,537 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 113 [2022-01-10 02:40:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:45,537 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2022-01-10 02:40:45,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2022-01-10 02:40:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 02:40:45,539 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:45,539 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:45,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:45,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:45,747 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1722788328, now seen corresponding path program 1 times [2022-01-10 02:40:45,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89478551] [2022-01-10 02:40:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:45,748 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:45,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:45,749 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:45,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 02:40:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:45,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 02:40:45,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:46,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:49,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:49,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89478551] [2022-01-10 02:40:49,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89478551] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:49,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:49,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-01-10 02:40:49,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766018723] [2022-01-10 02:40:49,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:49,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-10 02:40:49,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-10 02:40:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2022-01-10 02:40:49,013 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 50 states, 50 states have (on average 3.5) internal successors, (175), 50 states have internal predecessors, (175), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:41:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:04,431 INFO L93 Difference]: Finished difference Result 600 states and 877 transitions. [2022-01-10 02:41:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-10 02:41:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.5) internal successors, (175), 50 states have internal predecessors, (175), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2022-01-10 02:41:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:04,443 INFO L225 Difference]: With dead ends: 600 [2022-01-10 02:41:04,443 INFO L226 Difference]: Without dead ends: 465 [2022-01-10 02:41:04,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2901, Invalid=6029, Unknown=0, NotChecked=0, Total=8930 [2022-01-10 02:41:04,448 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 2433 mSDsluCounter, 5042 mSDsCounter, 0 mSdLazyCounter, 4489 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 5251 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 4489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:04,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2433 Valid, 5251 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 4489 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-01-10 02:41:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-10 02:41:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 210. [2022-01-10 02:41:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 199 states have (on average 1.5427135678391959) internal successors, (307), 201 states have internal predecessors, (307), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:41:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 325 transitions. [2022-01-10 02:41:04,472 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 325 transitions. Word has length 115 [2022-01-10 02:41:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:04,472 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 325 transitions. [2022-01-10 02:41:04,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.5) internal successors, (175), 50 states have internal predecessors, (175), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:41:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 325 transitions. [2022-01-10 02:41:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 02:41:04,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:04,474 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:04,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:04,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:04,683 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 39463391, now seen corresponding path program 1 times [2022-01-10 02:41:04,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819338400] [2022-01-10 02:41:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:04,684 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:04,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:04,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 02:41:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:04,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:41:04,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-01-10 02:41:04,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:04,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819338400] [2022-01-10 02:41:04,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819338400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:04,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:04,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:41:04,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617191366] [2022-01-10 02:41:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:04,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:41:04,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:41:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:41:04,939 INFO L87 Difference]: Start difference. First operand 210 states and 325 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:04,978 INFO L93 Difference]: Finished difference Result 223 states and 339 transitions. [2022-01-10 02:41:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:41:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2022-01-10 02:41:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:04,980 INFO L225 Difference]: With dead ends: 223 [2022-01-10 02:41:04,980 INFO L226 Difference]: Without dead ends: 217 [2022-01-10 02:41:04,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:41:04,983 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:04,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 233 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-10 02:41:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2022-01-10 02:41:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 206 states have internal predecessors, (313), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:41:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 331 transitions. [2022-01-10 02:41:04,998 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 331 transitions. Word has length 120 [2022-01-10 02:41:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:04,998 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 331 transitions. [2022-01-10 02:41:04,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 331 transitions. [2022-01-10 02:41:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 02:41:04,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:04,999 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:05,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:05,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:05,209 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:05,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 96721693, now seen corresponding path program 1 times [2022-01-10 02:41:05,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:05,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348981192] [2022-01-10 02:41:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:05,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:05,211 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:05,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 02:41:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:05,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:41:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-01-10 02:41:05,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:05,411 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:05,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348981192] [2022-01-10 02:41:05,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348981192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:05,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:05,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:41:05,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192117210] [2022-01-10 02:41:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:05,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:41:05,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:41:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:41:05,413 INFO L87 Difference]: Start difference. First operand 215 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:05,440 INFO L93 Difference]: Finished difference Result 221 states and 336 transitions. [2022-01-10 02:41:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:41:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2022-01-10 02:41:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:05,442 INFO L225 Difference]: With dead ends: 221 [2022-01-10 02:41:05,442 INFO L226 Difference]: Without dead ends: 203 [2022-01-10 02:41:05,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:41:05,443 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:05,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-01-10 02:41:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-01-10 02:41:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 192 states have (on average 1.5520833333333333) internal successors, (298), 195 states have internal predecessors, (298), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 02:41:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 313 transitions. [2022-01-10 02:41:05,457 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 313 transitions. Word has length 120 [2022-01-10 02:41:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:05,457 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 313 transitions. [2022-01-10 02:41:05,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 313 transitions. [2022-01-10 02:41:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-10 02:41:05,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:05,459 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:05,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 02:41:05,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:05,668 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1407344910, now seen corresponding path program 1 times [2022-01-10 02:41:05,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593606564] [2022-01-10 02:41:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:05,669 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:05,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:05,671 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:05,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 02:41:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:05,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:41:05,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-01-10 02:41:05,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:05,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593606564] [2022-01-10 02:41:05,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593606564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:05,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:05,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:41:05,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546225296] [2022-01-10 02:41:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:05,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:41:05,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:05,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:41:05,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:41:05,900 INFO L87 Difference]: Start difference. First operand 203 states and 313 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:05,926 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2022-01-10 02:41:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:41:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 122 [2022-01-10 02:41:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:05,927 INFO L225 Difference]: With dead ends: 229 [2022-01-10 02:41:05,927 INFO L226 Difference]: Without dead ends: 203 [2022-01-10 02:41:05,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:41:05,929 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:05,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-01-10 02:41:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-01-10 02:41:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 192 states have (on average 1.546875) internal successors, (297), 195 states have internal predecessors, (297), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 02:41:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 312 transitions. [2022-01-10 02:41:05,943 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 312 transitions. Word has length 122 [2022-01-10 02:41:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:05,943 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 312 transitions. [2022-01-10 02:41:05,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:41:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 312 transitions. [2022-01-10 02:41:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-10 02:41:05,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:05,944 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:05,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:06,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:06,154 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 820538896, now seen corresponding path program 1 times [2022-01-10 02:41:06,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:06,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172416177] [2022-01-10 02:41:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:06,155 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:06,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:06,167 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:06,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 02:41:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:06,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:41:06,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:41:06,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:41:06,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:06,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172416177] [2022-01-10 02:41:06,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172416177] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:06,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:06,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-01-10 02:41:06,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777502743] [2022-01-10 02:41:06,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:06,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:41:06,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:41:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:41:06,563 INFO L87 Difference]: Start difference. First operand 203 states and 312 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:06,595 INFO L93 Difference]: Finished difference Result 208 states and 316 transitions. [2022-01-10 02:41:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:41:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2022-01-10 02:41:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:06,596 INFO L225 Difference]: With dead ends: 208 [2022-01-10 02:41:06,597 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 02:41:06,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:41:06,597 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 18 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:06,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 244 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 02:41:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2022-01-10 02:41:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 187 states have (on average 1.5454545454545454) internal successors, (289), 190 states have internal predecessors, (289), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 02:41:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2022-01-10 02:41:06,611 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 122 [2022-01-10 02:41:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:06,612 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2022-01-10 02:41:06,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2022-01-10 02:41:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 02:41:06,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:06,613 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:06,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:06,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:06,824 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 38983873, now seen corresponding path program 1 times [2022-01-10 02:41:06,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553797570] [2022-01-10 02:41:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:06,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:06,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:06,826 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:06,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 02:41:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:06,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:41:06,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:41:07,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:41:07,245 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:07,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553797570] [2022-01-10 02:41:07,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553797570] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:07,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:07,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-01-10 02:41:07,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40174888] [2022-01-10 02:41:07,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:07,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:41:07,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:41:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:41:07,247 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:07,307 INFO L93 Difference]: Finished difference Result 225 states and 337 transitions. [2022-01-10 02:41:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:41:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2022-01-10 02:41:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:07,309 INFO L225 Difference]: With dead ends: 225 [2022-01-10 02:41:07,309 INFO L226 Difference]: Without dead ends: 195 [2022-01-10 02:41:07,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:41:07,310 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:07,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-10 02:41:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-01-10 02:41:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 187 states have internal predecessors, (241), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:41:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2022-01-10 02:41:07,322 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 125 [2022-01-10 02:41:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:07,322 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2022-01-10 02:41:07,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2022-01-10 02:41:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 02:41:07,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:07,323 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:07,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:07,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:07,533 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 147310070, now seen corresponding path program 2 times [2022-01-10 02:41:07,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:07,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853189384] [2022-01-10 02:41:07,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:07,534 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:07,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:07,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 02:41:07,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:41:07,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:07,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 02:41:07,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2022-01-10 02:41:07,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:08,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:08,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853189384] [2022-01-10 02:41:08,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853189384] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:41:08,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2128416374] [2022-01-10 02:41:08,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:08,038 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 02:41:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 02:41:08,040 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 02:41:08,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-01-10 02:41:08,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:41:08,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:08,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 02:41:08,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2022-01-10 02:41:08,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:08,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2128416374] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:41:08,424 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:08,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-01-10 02:41:08,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567772694] [2022-01-10 02:41:08,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:08,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:41:08,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:08,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:41:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:41:08,426 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:08,493 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2022-01-10 02:41:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:41:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2022-01-10 02:41:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:08,494 INFO L225 Difference]: With dead ends: 196 [2022-01-10 02:41:08,494 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:41:08,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:41:08,495 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:08,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:41:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:41:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:41:08,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2022-01-10 02:41:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:08,496 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:41:08,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:41:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:41:08,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:41:08,499 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:41:08,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:08,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:08,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:08,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:41:10,960 INFO L854 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (not (= |base2flt_#in~m| (_ bv0 32))) [2022-01-10 02:41:10,961 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (and (or (not (bvsle base2flt_~e (_ bv4294967168 32))) .cse0) (not (bvult |base2flt_#in~m| (_ bv16777216 32))) (or (not (bvsle (bvadd (_ bv4294967274 32) base2flt_~e) (_ bv4294967168 32))) .cse0))) [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L861 garLoopResultBuilder]: At program point base2fltENTRY(lines 24 82) the Hoare annotation is: true [2022-01-10 02:41:10,961 INFO L854 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (or (and (= base2flt_~e |base2flt_#in~e|) (= base2flt_~__retres4~0 (_ bv0 32)) (= base2flt_~m (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (not (= |base2flt_#in~m| (_ bv0 32)))) [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (and (not (= |base2flt_#in~m| (_ bv0 32))) (or (bvult base2flt_~m (_ bv16777216 32)) (not (= |base2flt_#in~m| (_ bv1 32))))) [2022-01-10 02:41:10,961 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2022-01-10 02:41:10,961 INFO L854 garLoopResultBuilder]: At program point L217(lines 147 219) the Hoare annotation is: (or (= (bvadd |ULTIMATE.start_main_~sb~0#1| (_ bv1 32)) (_ bv0 32)) (and (= (_ bv0 32) |ULTIMATE.start_mulflt_#res#1|) (= |ULTIMATE.start_mulflt_~__retres10~1#1| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|)) (and (= |ULTIMATE.start_main_~tmp~2#1| (_ bv1 32)) (not (bvult |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~zero~0#1|)) (= |ULTIMATE.start_main_~sb~0#1| (_ bv1 32)))) [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L861 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2022-01-10 02:41:10,962 INFO L858 garLoopResultBuilder]: For program point L256-1(lines 256 272) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L854 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L854 garLoopResultBuilder]: At program point L257-2(lines 257 266) the Hoare annotation is: (and (not (bvult |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~zero~0#1|)) (= |ULTIMATE.start_main_~tmp___0~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~tmp___1~0#1| (_ bv0 32))) [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L854 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: (or (= (bvadd |ULTIMATE.start_main_~sb~0#1| (_ bv1 32)) (_ bv0 32)) (and (= |ULTIMATE.start_main_~tmp~2#1| (_ bv1 32)) (not (bvult |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~zero~0#1|)) (= |ULTIMATE.start_main_~sb~0#1| (_ bv1 32))) (and (= |ULTIMATE.start_mulflt_~__retres10~1#1| (_ bv0 32)) (not (bvult (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|)))) [2022-01-10 02:41:10,963 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2022-01-10 02:41:10,963 INFO L861 garLoopResultBuilder]: At program point L274(lines 220 276) the Hoare annotation is: true [2022-01-10 02:41:10,964 INFO L854 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-01-10 02:41:10,964 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2022-01-10 02:41:10,964 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 02:41:10,967 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:10,968 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:41:10,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:41:10 BoogieIcfgContainer [2022-01-10 02:41:10,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:41:10,980 INFO L158 Benchmark]: Toolchain (without parser) took 41439.46ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 126.6MB in the beginning and 171.1MB in the end (delta: -44.5MB). Peak memory consumption was 105.5MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,980 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:41:10,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.43ms. Allocated memory is still 177.2MB. Free memory was 126.4MB in the beginning and 152.7MB in the end (delta: -26.4MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.39ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,981 INFO L158 Benchmark]: Boogie Preprocessor took 22.30ms. Allocated memory is still 177.2MB. Free memory was 150.6MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,981 INFO L158 Benchmark]: RCFGBuilder took 340.37ms. Allocated memory is still 177.2MB. Free memory was 149.1MB in the beginning and 136.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,981 INFO L158 Benchmark]: TraceAbstraction took 40788.34ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 135.4MB in the beginning and 171.1MB in the end (delta: -35.7MB). Peak memory consumption was 114.1MB. Max. memory is 8.0GB. [2022-01-10 02:41:10,983 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.43ms. Allocated memory is still 177.2MB. Free memory was 126.4MB in the beginning and 152.7MB in the end (delta: -26.4MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.39ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.30ms. Allocated memory is still 177.2MB. Free memory was 150.6MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.37ms. Allocated memory is still 177.2MB. Free memory was 149.1MB in the beginning and 136.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40788.34ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 135.4MB in the beginning and 171.1MB in the end (delta: -35.7MB). Peak memory consumption was 114.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 20, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5000 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5000 mSDsluCounter, 13033 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11615 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8175 IncrementalHoareTripleChecker+Invalid, 8985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 1418 mSDtfsCounter, 8175 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2783 GetRequests, 2442 SyntacticMatches, 1 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=15, InterpolantAutomatonStates: 294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 722 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 168 PreInvPairs, 665 NumberOfFragments, 137 HoareAnnotationTreeSize, 168 FomulaSimplifications, 16981 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 11610 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1609 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 7136 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2948 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 9198/11778 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: !(\old(m) == 0bv32) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (~bvadd16(sb, 1bv32) == 0bv32 || ((tmp == 1bv32 && !~bvult64(b, zero)) && sb == 1bv32)) || (__retres10 == 0bv32 && !~bvult64(0bv32, zero)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (~bvadd16(sb, 1bv32) == 0bv32 || ((0bv32 == \result && __retres10 == 0bv32) && 0bv32 == zero)) || ((tmp == 1bv32 && !~bvult64(b, zero)) && sb == 1bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((e == \old(e) && __retres4 == 0bv32) && m == ~bvshl32(~bvshl32(\old(m), 1bv32), 1bv32)) || !(\old(m) == 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: !(\old(m) == 0bv32) && (~bvult64(m, 16777216bv32) || !(\old(m) == 1bv32)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!~bvsle32(e, 4294967168bv32) || !(\old(e) == 0bv32)) && !~bvult64(\old(m), 16777216bv32)) && (!~bvsle32(~bvadd16(4294967274bv32, e), 4294967168bv32) || !(\old(e) == 0bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 02:41:11,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...