/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/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:41:29,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:41:29,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:41:29,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:41:29,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:41:29,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:41:29,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:41:29,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:41:29,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:41:29,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:41:29,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:41:29,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:41:29,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:41:29,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:41:29,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:41:29,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:41:29,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:41:29,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:41:29,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:41:29,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:41:29,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:41:29,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:41:29,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:41:29,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:41:29,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:41:29,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:41:29,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:41:29,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:41:29,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:41:29,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:41:29,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:41:29,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:41:29,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:41:29,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:41:29,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:41:29,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:41:29,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:41:29,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:41:29,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:41:29,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:41:29,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:41:29,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:41:29,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:41:29,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:41:29,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:41:29,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:41:29,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:41:29,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:41:29,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:41:29,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:41:29,665 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:41:29,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:41:29,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:41:29,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:41:29,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:41:29,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:41:29,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:41:29,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:41:29,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:41:29,668 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:41:29,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:41:29,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:41:29,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:41:29,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:41:29,899 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:41:29,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-10 06:41:29,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f0a1e6/fb6d223286df4415a9e11b23518277ca/FLAG3bafe27da [2022-01-10 06:41:30,321 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:41:30,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-10 06:41:30,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f0a1e6/fb6d223286df4415a9e11b23518277ca/FLAG3bafe27da [2022-01-10 06:41:30,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1f0a1e6/fb6d223286df4415a9e11b23518277ca [2022-01-10 06:41:30,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:41:30,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:41:30,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:41:30,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:41:30,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:41:30,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:41:30" (1/1) ... [2022-01-10 06:41:30,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f22a983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:30, skipping insertion in model container [2022-01-10 06:41:30,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:41:30" (1/1) ... [2022-01-10 06:41:30,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:41:30,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:41:30,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-01-10 06:41:30,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:41:30,980 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:41:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-01-10 06:41:31,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:41:31,032 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:41:31,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31 WrapperNode [2022-01-10 06:41:31,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:41:31,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:41:31,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:41:31,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:41:31,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,069 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 194 [2022-01-10 06:41:31,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:41:31,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:41:31,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:41:31,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:41:31,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:41:31,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:41:31,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:41:31,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:41:31,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (1/1) ... [2022-01-10 06:41:31,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:41:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:41:31,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:41:31,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:41:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:41:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 06:41:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 06:41:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:41:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-01-10 06:41:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-01-10 06:41:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-01-10 06:41:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-01-10 06:41:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:41:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:41:31,309 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:41:31,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:41:31,596 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:41:31,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:41:31,601 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 06:41:31,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:41:31 BoogieIcfgContainer [2022-01-10 06:41:31,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:41:31,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:41:31,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:41:31,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:41:31,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:41:30" (1/3) ... [2022-01-10 06:41:31,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a4fbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:41:31, skipping insertion in model container [2022-01-10 06:41:31,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:41:31" (2/3) ... [2022-01-10 06:41:31,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a4fbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:41:31, skipping insertion in model container [2022-01-10 06:41:31,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:41:31" (3/3) ... [2022-01-10 06:41:31,612 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-01-10 06:41:31,617 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:41:31,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:41:31,672 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:41:31,677 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:41:31,678 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:41:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:41:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 06:41:31,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:31,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:31,715 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:31,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2022-01-10 06:41:31,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481662841] [2022-01-10 06:41:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:31,740 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:31,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:31,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:31,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:41:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:31,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:31,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:31,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:31,998 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:31,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481662841] [2022-01-10 06:41:31,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481662841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:31,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:31,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:32,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584407846] [2022-01-10 06:41:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:32,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:32,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,020 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:32,059 INFO L93 Difference]: Finished difference Result 203 states and 309 transitions. [2022-01-10 06:41:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:32,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-01-10 06:41:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:32,072 INFO L225 Difference]: With dead ends: 203 [2022-01-10 06:41:32,073 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 06:41:32,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,079 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:32,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 198 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 06:41:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-01-10 06:41:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 109 states have internal predecessors, (149), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-01-10 06:41:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2022-01-10 06:41:32,144 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 43 [2022-01-10 06:41:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:32,144 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2022-01-10 06:41:32,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2022-01-10 06:41:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:41:32,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:32,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:32,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:32,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:32,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2022-01-10 06:41:32,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:32,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476274899] [2022-01-10 06:41:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:32,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:32,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:32,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:41:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:32,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:32,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:32,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:32,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:32,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476274899] [2022-01-10 06:41:32,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476274899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:32,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:32,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:32,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398296673] [2022-01-10 06:41:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:32,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:32,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:32,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:32,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,487 INFO L87 Difference]: Start difference. First operand 123 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:32,514 INFO L93 Difference]: Finished difference Result 331 states and 459 transitions. [2022-01-10 06:41:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-10 06:41:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:32,516 INFO L225 Difference]: With dead ends: 331 [2022-01-10 06:41:32,516 INFO L226 Difference]: Without dead ends: 216 [2022-01-10 06:41:32,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,517 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:32,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-01-10 06:41:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2022-01-10 06:41:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.378698224852071) internal successors, (233), 170 states have internal predecessors, (233), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-01-10 06:41:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2022-01-10 06:41:32,532 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 44 [2022-01-10 06:41:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:32,532 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2022-01-10 06:41:32,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2022-01-10 06:41:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:41:32,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:32,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 06:41:32,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:32,740 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2022-01-10 06:41:32,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22928714] [2022-01-10 06:41:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:32,741 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:32,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:32,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:32,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:41:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:32,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:32,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:32,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:32,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22928714] [2022-01-10 06:41:32,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22928714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:32,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:32,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:32,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133967215] [2022-01-10 06:41:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:32,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:32,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,844 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:32,866 INFO L93 Difference]: Finished difference Result 543 states and 750 transitions. [2022-01-10 06:41:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-10 06:41:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:32,868 INFO L225 Difference]: With dead ends: 543 [2022-01-10 06:41:32,868 INFO L226 Difference]: Without dead ends: 361 [2022-01-10 06:41:32,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:32,870 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:32,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 183 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-01-10 06:41:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 347. [2022-01-10 06:41:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 308 states have (on average 1.3474025974025974) internal successors, (415), 311 states have internal predecessors, (415), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (32), 20 states have call predecessors, (32), 22 states have call successors, (32) [2022-01-10 06:41:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 471 transitions. [2022-01-10 06:41:32,908 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 471 transitions. Word has length 44 [2022-01-10 06:41:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:32,909 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 471 transitions. [2022-01-10 06:41:32,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:41:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 471 transitions. [2022-01-10 06:41:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 06:41:32,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:32,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:32,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:33,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,118 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2022-01-10 06:41:33,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:33,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069848967] [2022-01-10 06:41:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:33,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:33,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:41:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:33,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:33,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:33,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:33,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:33,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069848967] [2022-01-10 06:41:33,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069848967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:33,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:33,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:33,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643442474] [2022-01-10 06:41:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:33,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:33,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:33,284 INFO L87 Difference]: Start difference. First operand 347 states and 471 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:41:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:33,324 INFO L93 Difference]: Finished difference Result 859 states and 1168 transitions. [2022-01-10 06:41:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2022-01-10 06:41:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:33,338 INFO L225 Difference]: With dead ends: 859 [2022-01-10 06:41:33,339 INFO L226 Difference]: Without dead ends: 520 [2022-01-10 06:41:33,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:33,341 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:33,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-10 06:41:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2022-01-10 06:41:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 459 states have (on average 1.298474945533769) internal successors, (596), 462 states have internal predecessors, (596), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (54), 34 states have call predecessors, (54), 36 states have call successors, (54) [2022-01-10 06:41:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 688 transitions. [2022-01-10 06:41:33,380 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 688 transitions. Word has length 61 [2022-01-10 06:41:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:33,380 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 688 transitions. [2022-01-10 06:41:33,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:41:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 688 transitions. [2022-01-10 06:41:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 06:41:33,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:33,383 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:33,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:33,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,583 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2022-01-10 06:41:33,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:33,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621984314] [2022-01-10 06:41:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:33,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:33,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:33,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:41:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:33,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:33,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 06:41:33,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:33,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:33,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621984314] [2022-01-10 06:41:33,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621984314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:33,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:33,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:33,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877715935] [2022-01-10 06:41:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:33,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:33,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:33,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:33,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:33,717 INFO L87 Difference]: Start difference. First operand 520 states and 688 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:33,742 INFO L93 Difference]: Finished difference Result 1067 states and 1409 transitions. [2022-01-10 06:41:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-01-10 06:41:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:33,745 INFO L225 Difference]: With dead ends: 1067 [2022-01-10 06:41:33,745 INFO L226 Difference]: Without dead ends: 647 [2022-01-10 06:41:33,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:33,747 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:33,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-01-10 06:41:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-01-10 06:41:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 572 states have (on average 1.2727272727272727) internal successors, (728), 575 states have internal predecessors, (728), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (66), 42 states have call predecessors, (66), 44 states have call successors, (66) [2022-01-10 06:41:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 840 transitions. [2022-01-10 06:41:33,769 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 840 transitions. Word has length 66 [2022-01-10 06:41:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:33,769 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 840 transitions. [2022-01-10 06:41:33,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 840 transitions. [2022-01-10 06:41:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:41:33,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:33,771 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:33,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:33,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2022-01-10 06:41:33,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413752379] [2022-01-10 06:41:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:33,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:33,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:33,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:41:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:34,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:41:34,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:41:34,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:34,187 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:34,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413752379] [2022-01-10 06:41:34,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413752379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:34,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:34,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:41:34,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761985724] [2022-01-10 06:41:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:34,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:41:34,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:41:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:41:34,190 INFO L87 Difference]: Start difference. First operand 647 states and 840 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:34,276 INFO L93 Difference]: Finished difference Result 1284 states and 1685 transitions. [2022-01-10 06:41:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:41:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-01-10 06:41:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:34,288 INFO L225 Difference]: With dead ends: 1284 [2022-01-10 06:41:34,288 INFO L226 Difference]: Without dead ends: 790 [2022-01-10 06:41:34,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 06:41:34,290 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 50 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:34,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-01-10 06:41:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 688. [2022-01-10 06:41:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 611 states have (on average 1.2553191489361701) internal successors, (767), 616 states have internal predecessors, (767), 46 states have call successors, (46), 29 states have call predecessors, (46), 30 states have return successors, (68), 42 states have call predecessors, (68), 44 states have call successors, (68) [2022-01-10 06:41:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 881 transitions. [2022-01-10 06:41:34,314 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 881 transitions. Word has length 67 [2022-01-10 06:41:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:34,314 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 881 transitions. [2022-01-10 06:41:34,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 881 transitions. [2022-01-10 06:41:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:41:34,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:34,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:34,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:34,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:34,523 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 70411063, now seen corresponding path program 1 times [2022-01-10 06:41:34,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:34,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097877131] [2022-01-10 06:41:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:34,524 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:34,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:41:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:34,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:41:34,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 06:41:34,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:34,650 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:34,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097877131] [2022-01-10 06:41:34,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097877131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:34,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:34,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:41:34,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163888248] [2022-01-10 06:41:34,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:34,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:41:34,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:41:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:41:34,652 INFO L87 Difference]: Start difference. First operand 688 states and 881 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:34,687 INFO L93 Difference]: Finished difference Result 1181 states and 1527 transitions. [2022-01-10 06:41:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:41:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-01-10 06:41:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:34,689 INFO L225 Difference]: With dead ends: 1181 [2022-01-10 06:41:34,689 INFO L226 Difference]: Without dead ends: 599 [2022-01-10 06:41:34,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 06:41:34,691 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:34,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 359 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-10 06:41:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 579. [2022-01-10 06:41:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 516 states have (on average 1.244186046511628) internal successors, (642), 523 states have internal predecessors, (642), 36 states have call successors, (36), 23 states have call predecessors, (36), 26 states have return successors, (54), 32 states have call predecessors, (54), 34 states have call successors, (54) [2022-01-10 06:41:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 732 transitions. [2022-01-10 06:41:34,708 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 732 transitions. Word has length 67 [2022-01-10 06:41:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:34,708 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 732 transitions. [2022-01-10 06:41:34,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:41:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 732 transitions. [2022-01-10 06:41:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:41:34,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:34,710 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:34,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:34,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:34,916 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2120178039, now seen corresponding path program 1 times [2022-01-10 06:41:34,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:34,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006477560] [2022-01-10 06:41:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:34,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:34,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:41:34,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:41:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:34,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:41:34,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:35,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:41:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:41:35,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:35,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006477560] [2022-01-10 06:41:35,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006477560] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:41:35,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:41:35,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 06:41:35,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042128446] [2022-01-10 06:41:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:35,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:41:35,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:41:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:41:35,213 INFO L87 Difference]: Start difference. First operand 579 states and 732 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:41:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:35,261 INFO L93 Difference]: Finished difference Result 634 states and 799 transitions. [2022-01-10 06:41:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:41:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2022-01-10 06:41:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:35,264 INFO L225 Difference]: With dead ends: 634 [2022-01-10 06:41:35,265 INFO L226 Difference]: Without dead ends: 631 [2022-01-10 06:41:35,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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 06:41:35,266 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 172 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:35,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 183 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-01-10 06:41:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 578. [2022-01-10 06:41:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 516 states have (on average 1.2403100775193798) internal successors, (640), 522 states have internal predecessors, (640), 35 states have call successors, (35), 23 states have call predecessors, (35), 26 states have return successors, (54), 32 states have call predecessors, (54), 34 states have call successors, (54) [2022-01-10 06:41:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 729 transitions. [2022-01-10 06:41:35,293 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 729 transitions. Word has length 67 [2022-01-10 06:41:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:35,294 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 729 transitions. [2022-01-10 06:41:35,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:41:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 729 transitions. [2022-01-10 06:41:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 06:41:35,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:35,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:35,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:41:35,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:41:35,520 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1300686438, now seen corresponding path program 1 times [2022-01-10 06:41:35,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:35,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731807688] [2022-01-10 06:41:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:35,522 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:35,523 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 06:41:35,525 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 06:41:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:35,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:41:35,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:41:35,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:41:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:41:36,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:36,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731807688] [2022-01-10 06:41:36,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731807688] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:41:36,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:41:36,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-01-10 06:41:36,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376916082] [2022-01-10 06:41:36,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:41:36,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:41:36,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:41:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:41:36,105 INFO L87 Difference]: Start difference. First operand 578 states and 729 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:41:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:36,229 INFO L93 Difference]: Finished difference Result 1401 states and 1771 transitions. [2022-01-10 06:41:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:41:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-01-10 06:41:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:36,234 INFO L225 Difference]: With dead ends: 1401 [2022-01-10 06:41:36,234 INFO L226 Difference]: Without dead ends: 1398 [2022-01-10 06:41:36,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:41:36,236 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 297 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:36,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 753 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:41:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-01-10 06:41:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 927. [2022-01-10 06:41:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 829 states have (on average 1.2448733413751507) internal successors, (1032), 841 states have internal predecessors, (1032), 54 states have call successors, (54), 36 states have call predecessors, (54), 43 states have return successors, (85), 49 states have call predecessors, (85), 53 states have call successors, (85) [2022-01-10 06:41:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1171 transitions. [2022-01-10 06:41:36,305 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1171 transitions. Word has length 68 [2022-01-10 06:41:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:36,306 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1171 transitions. [2022-01-10 06:41:36,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:41:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1171 transitions. [2022-01-10 06:41:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-10 06:41:36,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:36,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:36,332 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 06:41:36,519 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 06:41:36,520 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 892057432, now seen corresponding path program 2 times [2022-01-10 06:41:36,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:36,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612375231] [2022-01-10 06:41:36,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:41:36,521 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:36,522 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 06:41:36,524 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 06:41:36,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:41:36,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:41:36,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:36,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:41:36,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:36,669 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:36,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612375231] [2022-01-10 06:41:36,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612375231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:36,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:36,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:36,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197168863] [2022-01-10 06:41:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:36,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:36,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:36,671 INFO L87 Difference]: Start difference. First operand 927 states and 1171 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:41:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:36,710 INFO L93 Difference]: Finished difference Result 1568 states and 1988 transitions. [2022-01-10 06:41:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2022-01-10 06:41:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:36,713 INFO L225 Difference]: With dead ends: 1568 [2022-01-10 06:41:36,713 INFO L226 Difference]: Without dead ends: 817 [2022-01-10 06:41:36,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:36,715 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:36,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-01-10 06:41:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 805. [2022-01-10 06:41:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 720 states have (on average 1.2361111111111112) internal successors, (890), 732 states have internal predecessors, (890), 47 states have call successors, (47), 31 states have call predecessors, (47), 37 states have return successors, (74), 41 states have call predecessors, (74), 46 states have call successors, (74) [2022-01-10 06:41:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1011 transitions. [2022-01-10 06:41:36,743 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1011 transitions. Word has length 87 [2022-01-10 06:41:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:36,743 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1011 transitions. [2022-01-10 06:41:36,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:41:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1011 transitions. [2022-01-10 06:41:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-10 06:41:36,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:36,745 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:36,768 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 06:41:36,951 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 06:41:36,952 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -265590444, now seen corresponding path program 1 times [2022-01-10 06:41:36,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128160246] [2022-01-10 06:41:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:36,953 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:36,954 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 06:41:36,955 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 06:41:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:37,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:41:37,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:41:37,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:37,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128160246] [2022-01-10 06:41:37,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128160246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:37,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:37,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:41:37,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033232078] [2022-01-10 06:41:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:37,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:41:37,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:41:37,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:41:37,142 INFO L87 Difference]: Start difference. First operand 805 states and 1011 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:41:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:37,229 INFO L93 Difference]: Finished difference Result 1635 states and 2058 transitions. [2022-01-10 06:41:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:41:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2022-01-10 06:41:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:37,233 INFO L225 Difference]: With dead ends: 1635 [2022-01-10 06:41:37,233 INFO L226 Difference]: Without dead ends: 838 [2022-01-10 06:41:37,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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 06:41:37,236 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:37,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-01-10 06:41:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 805. [2022-01-10 06:41:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 720 states have (on average 1.2152777777777777) internal successors, (875), 732 states have internal predecessors, (875), 47 states have call successors, (47), 31 states have call predecessors, (47), 37 states have return successors, (73), 41 states have call predecessors, (73), 46 states have call successors, (73) [2022-01-10 06:41:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 995 transitions. [2022-01-10 06:41:37,289 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 995 transitions. Word has length 102 [2022-01-10 06:41:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:37,289 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 995 transitions. [2022-01-10 06:41:37,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:41:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 995 transitions. [2022-01-10 06:41:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 06:41:37,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:41:37,291 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:37,314 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 06:41:37,500 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 06:41:37,501 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:41:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:41:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1044261679, now seen corresponding path program 1 times [2022-01-10 06:41:37,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:41:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272516290] [2022-01-10 06:41:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:41:37,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:41:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:41:37,507 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 06:41:37,508 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 06:41:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:41:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:41:37,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:41:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:41:37,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:41:37,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:41:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272516290] [2022-01-10 06:41:37,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272516290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:41:37,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:41:37,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:41:37,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434379216] [2022-01-10 06:41:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:41:37,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:41:37,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:41:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:41:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:37,692 INFO L87 Difference]: Start difference. First operand 805 states and 995 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 06:41:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:41:37,731 INFO L93 Difference]: Finished difference Result 1129 states and 1387 transitions. [2022-01-10 06:41:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:41:37,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-01-10 06:41:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:41:37,735 INFO L225 Difference]: With dead ends: 1129 [2022-01-10 06:41:37,735 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 06:41:37,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:41:37,737 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 60 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:41:37,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 203 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:41:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 06:41:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 06:41:37,751 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 06:41:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 06:41:37,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-01-10 06:41:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:41:37,752 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 06:41:37,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 06:41:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 06:41:37,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 06:41:37,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:41:37,785 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 06:41:37,955 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 06:41:37,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 06:41:42,184 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-01-10 06:41:42,185 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 76 100) the Hoare annotation is: (let ((.cse1 (= (_ bv2 32) ~c_dr_st~0)) (.cse3 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse4 (not (= ~q_free~0 (_ bv0 32)))) (.cse2 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0)))) (and (or (not (= ~p_num_write~0 ~c_num_read~0)) (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse0 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse1 .cse2 .cse3) (or .cse4 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse1 .cse3 .cse0) (or (not (= ~p_dw_pc~0 (_ bv0 32))) (not (= ~p_num_write~0 (_ bv1 32))) (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse4 .cse2 (= ~c_dr_st~0 (_ bv0 32)) .cse0))) [2022-01-10 06:41:42,185 INFO L854 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse6 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse7 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse3 (not (= ~q_free~0 (_ bv0 32)))) (.cse4 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (and .cse6 .cse7)) (.cse8 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse5 (not (= |old(~c_dr_st~0)| (_ bv2 32))))) (and (or (not (= ~p_num_write~0 ~c_num_read~0)) (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse0 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse0) (or (and .cse6 (= ~c_dr_st~0 (_ bv0 32)) .cse7) .cse1 (not (= ~p_num_write~0 (_ bv1 32))) (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse3 .cse8 .cse0) (or .cse9 .cse8 .cse5) (or .cse3 .cse4 .cse9 .cse5 .cse0) (or .cse1 .cse2 .cse8 .cse5)))) [2022-01-10 06:41:42,185 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-01-10 06:41:42,185 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L854 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse3 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse6 (= |immediate_notify_threads_~tmp~0#1| (_ bv0 32))) (.cse7 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse4 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| (_ bv0 32))) (.cse5 (= |immediate_notify_threads_is_do_read_c_triggered_#res#1| (_ bv0 32))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse12 (and .cse3 .cse6 .cse7)) (.cse2 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse1 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse10 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse13 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse15 (not (= ~q_free~0 (_ bv1 32)))) (.cse16 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 (not (= ~p_num_write~0 (_ bv1 32))) (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse1 .cse2 (and .cse3 .cse4 .cse5 (= ~c_dr_st~0 (_ bv0 32)) .cse6 .cse7) .cse8) (or (and .cse4 .cse9 .cse5) .cse2 .cse10) (or .cse0 .cse1 .cse11 .cse12 .cse10 .cse8) (or .cse13 (and .cse4 .cse5) .cse2 .cse8 .cse14 .cse15 .cse16) (or .cse0 .cse12 .cse2 .cse10) (or .cse1 .cse11 .cse9 .cse10 .cse8) (let ((.cse17 (= |old(~c_dr_st~0)| ~c_dr_st~0))) (or (and (= ~p_dw_st~0 (_ bv0 32)) .cse17) .cse13 .cse8 .cse14 .cse15 .cse16 (and (= ~p_dw_st~0 (_ bv2 32)) .cse17 .cse6)))))) [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 76 100) no Hoare annotation was computed. [2022-01-10 06:41:42,186 INFO L854 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse4 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32))) (.cse2 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse5 (not (= ~q_free~0 (_ bv0 32)))) (.cse6 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse3 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0)))) (and (or (not (= ~p_num_write~0 ~c_num_read~0)) (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse0 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse6 .cse3 .cse0 .cse4) (or .cse1 (not (= ~p_num_write~0 (_ bv1 32))) (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse5 (and (= ~c_dr_st~0 (_ bv0 32)) .cse4) .cse2 .cse0) (or .cse7 .cse2 .cse3) (or .cse5 .cse6 .cse7 .cse3 .cse0))) [2022-01-10 06:41:42,186 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L854 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse2 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse4 (= |immediate_notify_threads_~tmp~0#1| (_ bv0 32))) (.cse5 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse9 (and .cse2 .cse4 .cse5)) (.cse3 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| (_ bv0 32))) (.cse6 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse1 (not (= ~q_free~0 (_ bv0 32)))) (.cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse11 (= (_ bv2 32) ~c_dr_st~0)) (.cse10 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse12 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse14 (not (= ~q_free~0 (_ bv1 32)))) (.cse15 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 (not (= ~p_num_write~0 (_ bv1 32))) (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse1 (and .cse2 .cse3 (= ~c_dr_st~0 (_ bv0 32)) .cse4 .cse5) .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse10 .cse7) (or (and .cse3 .cse11) .cse6 .cse10) (or .cse0 .cse9 .cse6 .cse10) (or .cse12 .cse3 .cse6 .cse7 .cse13 .cse14 .cse15) (or .cse1 .cse8 .cse11 .cse10 .cse7) (let ((.cse16 (= |old(~c_dr_st~0)| ~c_dr_st~0))) (or (and (= ~p_dw_st~0 (_ bv0 32)) .cse16) .cse12 .cse7 .cse13 .cse14 .cse15 (and (= ~p_dw_st~0 (_ bv2 32)) .cse16 .cse4)))))) [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 220 239) the Hoare annotation is: true [2022-01-10 06:41:42,187 INFO L861 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: true [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2022-01-10 06:41:42,187 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 220 239) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L854 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-01-10 06:41:42,188 INFO L854 garLoopResultBuilder]: At program point L192-1(lines 148 200) the Hoare annotation is: (let ((.cse1 (= ~p_dw_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_last_write~0 ~c_last_read~0)) (.cse3 (= ~q_free~0 (_ bv1 32))) (.cse4 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 (= ~p_dw_st~0 (_ bv0 32)) .cse3 .cse4))) [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L854 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point L300-1(line 300) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-01-10 06:41:42,188 INFO L854 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~c_dr_st~0))) (or (and .cse0 .cse1) (and .cse2 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse0 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) (and .cse2 .cse1 (= ~p_num_write~0 ~c_num_read~0)))) [2022-01-10 06:41:42,189 INFO L854 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,189 INFO L858 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-01-10 06:41:42,189 INFO L858 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-01-10 06:41:42,189 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-01-10 06:41:42,189 INFO L858 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-01-10 06:41:42,189 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) (= ~p_dw_st~0 (_ bv2 32))) [2022-01-10 06:41:42,189 INFO L854 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,189 INFO L854 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse0 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= ~q_free~0 (_ bv1 32))) (.cse7 (= ~c_dr_st~0 (_ bv0 32))) (.cse2 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (= (_ bv2 32) ~c_dr_st~0) .cse2) (and .cse3 .cse4 .cse5 (= ~p_dw_st~0 (_ bv2 32)) .cse6 .cse0 .cse1 .cse7 .cse2) (and .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 (_ bv0 32)) .cse0 .cse1 .cse7 .cse2))) [2022-01-10 06:41:42,189 INFO L861 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2022-01-10 06:41:42,189 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2022-01-10 06:41:42,190 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-01-10 06:41:42,190 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-01-10 06:41:42,190 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2022-01-10 06:41:42,190 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_st~0 (_ bv2 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0)) [2022-01-10 06:41:42,190 INFO L858 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-01-10 06:41:42,190 INFO L861 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2022-01-10 06:41:42,190 INFO L854 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 (_ bv0 32))) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse3 (= (_ bv2 32) ~c_dr_st~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 (= ~c_dr_st~0 (_ bv0 32))) (and (= ~c_dr_pc~0 (_ bv0 32)) .cse3) (and .cse0 .cse1 .cse2 .cse3))) [2022-01-10 06:41:42,190 INFO L854 garLoopResultBuilder]: At program point L196(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 (_ bv1 32))) (.cse2 (= (_ bv2 32) ~c_dr_st~0)) (.cse3 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_dw_st~0 (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse0 (= ~p_dw_st~0 (_ bv2 32)) .cse1 .cse2 .cse3))) [2022-01-10 06:41:42,190 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-01-10 06:41:42,190 INFO L854 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L854 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L854 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-01-10 06:41:42,191 INFO L854 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-01-10 06:41:42,192 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse1 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse9 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_st~0 (_ bv2 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse10 .cse11 .cse5 .cse3 .cse12) (and .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse3 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse7))) [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-01-10 06:41:42,192 INFO L854 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse1 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (= ~q_free~0 (_ bv1 32))) (.cse3 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_dr_st~0))) (or (and .cse0 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) .cse1 .cse2 .cse3 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse1 .cse4) (and .cse0 .cse2 .cse4 (= ~p_num_write~0 ~c_num_read~0)) (and .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse5 .cse3) (and .cse0 .cse5 .cse4))) [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-01-10 06:41:42,192 INFO L854 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_dr_st~0))) (or (and .cse0 .cse1) (and .cse2 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse3 .cse0 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) (and .cse2 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse3 .cse1))) [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2022-01-10 06:41:42,192 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-01-10 06:41:42,193 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 06:41:42,193 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-01-10 06:41:42,193 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-01-10 06:41:42,196 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:41:42,197 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:41:42,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:41:42 BoogieIcfgContainer [2022-01-10 06:41:42,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:41:42,226 INFO L158 Benchmark]: Toolchain (without parser) took 11492.68ms. Allocated memory was 180.4MB in the beginning and 261.1MB in the end (delta: 80.7MB). Free memory was 129.3MB in the beginning and 215.5MB in the end (delta: -86.2MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,226 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:41:42,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.23ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 155.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.19ms. Allocated memory is still 180.4MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,227 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 180.4MB. Free memory was 153.4MB in the beginning and 151.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,227 INFO L158 Benchmark]: RCFGBuilder took 502.79ms. Allocated memory is still 180.4MB. Free memory was 151.9MB in the beginning and 138.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,227 INFO L158 Benchmark]: TraceAbstraction took 10621.14ms. Allocated memory was 180.4MB in the beginning and 261.1MB in the end (delta: 80.7MB). Free memory was 137.7MB in the beginning and 215.5MB in the end (delta: -77.8MB). Peak memory consumption was 136.1MB. Max. memory is 8.0GB. [2022-01-10 06:41:42,229 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.09ms. Allocated memory is still 180.4MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.23ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 155.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.19ms. Allocated memory is still 180.4MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 180.4MB. Free memory was 153.4MB in the beginning and 151.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 502.79ms. Allocated memory is still 180.4MB. Free memory was 151.9MB in the beginning and 138.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10621.14ms. Allocated memory was 180.4MB in the beginning and 261.1MB in the end (delta: 80.7MB). Free memory was 137.7MB in the beginning and 215.5MB in the end (delta: -77.8MB). Peak memory consumption was 136.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: 19]: 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 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1013 mSDsluCounter, 3285 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1839 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 1446 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 918 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=927occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 735 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 912 PreInvPairs, 1116 NumberOfFragments, 2108 HoareAnnotationTreeSize, 912 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7168 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 1868 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1643 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 264/294 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: 105]: Loop Invariant Derived loop invariant: ((c_dr_pc == 0bv32 && 2bv32 == c_dr_st) || (((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && c_dr_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((p_last_write == q_buf_0 && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((!(p_num_write == c_num_read) || (p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) && (((!(p_dw_pc == 0bv32) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32)) || __retres1 == 0bv32)) && (((((!(p_dw_pc == 0bv32) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0)) || __retres1 == 0bv32)) && (((((((!(p_dw_pc == 0bv32) || !(p_num_write == 1bv32)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(q_free == 0bv32)) || (c_dr_st == 0bv32 && __retres1 == 0bv32)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0))) && ((2bv32 == c_dr_st || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((!(q_free == 0bv32) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((c_dr_pc == 0bv32 && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32 - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_pc == 0bv32) || !(p_num_write == 1bv32)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(q_free == 0bv32)) || ((((\result == 0bv32 && __retres1 == 0bv32) && c_dr_st == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) && (((((!(p_dw_pc == 0bv32) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && (((__retres1 == 0bv32 && 2bv32 == c_dr_st) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && (((!(p_dw_pc == 0bv32) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((((!(p_num_write == c_num_read) || __retres1 == 0bv32) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read))) && ((((!(q_free == 0bv32) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && (((((((p_dw_st == 0bv32 && \old(c_dr_st) == c_dr_st) || !(p_num_write == c_num_read)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) || ((p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st) && tmp == 0bv32)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((!(p_num_write == c_num_read) || (p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) && (((((!(p_dw_pc == 0bv32) || (\result == 0bv32 && __retres1 == 0bv32)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && (((((((((\result == 0bv32 && c_dr_st == 0bv32) && __retres1 == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_num_write == 1bv32)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(q_free == 0bv32)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0))) && ((2bv32 == c_dr_st || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((!(q_free == 0bv32) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && (((!(p_dw_pc == 0bv32) || (\result == 0bv32 && __retres1 == 0bv32)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_pc == 0bv32) || !(p_num_write == 1bv32)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(q_free == 0bv32)) || !(c_dr_pc == 0bv32)) || (((((\result == 0bv32 && __retres1 == 0bv32) && \result == 0bv32) && c_dr_st == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32)) || !(p_last_write == q_buf_0)) && ((((__retres1 == 0bv32 && 2bv32 == c_dr_st) && \result == 0bv32) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && (((((!(p_dw_pc == 0bv32) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && ((((((!(p_num_write == c_num_read) || (__retres1 == 0bv32 && \result == 0bv32)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read))) && (((!(p_dw_pc == 0bv32) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((!(q_free == 0bv32) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(p_last_write == q_buf_0))) && (((((((p_dw_st == 0bv32 && \old(c_dr_st) == c_dr_st) || !(p_num_write == c_num_read)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) || ((p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st) && tmp == 0bv32)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || (((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && c_dr_st == 0bv32)) || ((p_last_write == q_buf_0 && q_free == 0bv32) && 2bv32 == c_dr_st) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((p_last_write == q_buf_0 && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_st == 0bv32) || ((((p_last_write == q_buf_0 && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (c_dr_pc == 0bv32 && 2bv32 == c_dr_st)) || (((p_last_write == q_buf_0 && q_free == 0bv32) && p_dw_st == 2bv32) && 2bv32 == c_dr_st)) || ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((p_last_write == q_buf_0 && p_dw_st == 2bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) RESULT: Ultimate proved your program to be correct! [2022-01-10 06:41:42,275 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...