/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:56:25,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:56:25,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:56:25,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:56:25,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:56:25,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:56:25,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:56:25,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:56:25,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:56:25,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:56:25,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:56:25,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:56:25,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:56:25,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:56:25,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:56:25,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:56:25,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:56:25,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:56:25,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:56:25,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:56:25,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:56:25,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:56:25,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:56:25,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:56:25,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:56:25,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:56:25,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:56:25,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:56:25,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:56:25,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:56:25,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:56:25,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:56:25,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:56:25,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:56:25,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:56:25,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:56:25,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:56:25,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:56:25,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:56:25,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:56:25,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:56:25,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:56:25,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:56:25,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:56:25,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:56:25,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:56:25,679 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:56:25,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:56:25,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:56:25,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:56:25,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:56:25,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:56:25,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:56:25,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:56:25,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:56:25,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:56:25,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:56:25,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:56:25,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:56:25,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:56:25,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:56:25,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:56:25,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:56:25,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:25,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:56:25,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:56:25,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:56:25,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:56:25,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:56:25,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:56:25,686 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:56:25,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:56:25,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:56:25,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:56:25,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:56:25,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:56:25,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:56:25,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-18 13:56:26,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4b6ec3/350898ba6d1f4895a976b4cde3ef4ca6/FLAGb11748e97 [2019-12-18 13:56:26,636 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:56:26,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-18 13:56:26,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4b6ec3/350898ba6d1f4895a976b4cde3ef4ca6/FLAGb11748e97 [2019-12-18 13:56:26,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4b6ec3/350898ba6d1f4895a976b4cde3ef4ca6 [2019-12-18 13:56:26,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:56:26,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:56:26,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:26,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:56:26,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:56:26,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:26" (1/1) ... [2019-12-18 13:56:26,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae3fdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:26, skipping insertion in model container [2019-12-18 13:56:26,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:26" (1/1) ... [2019-12-18 13:56:26,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:56:26,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:56:27,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:27,528 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:56:27,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:27,667 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:56:27,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27 WrapperNode [2019-12-18 13:56:27,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:27,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:27,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:56:27,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:56:27,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:27,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:56:27,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:56:27,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:56:27,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:56:27,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:56:27,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:56:27,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:56:27,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:56:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:56:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:56:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:56:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:56:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:56:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:56:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:56:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:56:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:56:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:56:27,865 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:56:28,559 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:56:28,560 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:56:28,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:28 BoogieIcfgContainer [2019-12-18 13:56:28,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:56:28,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:56:28,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:56:28,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:56:28,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:56:26" (1/3) ... [2019-12-18 13:56:28,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76dc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:28, skipping insertion in model container [2019-12-18 13:56:28,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (2/3) ... [2019-12-18 13:56:28,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76dc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:28, skipping insertion in model container [2019-12-18 13:56:28,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:28" (3/3) ... [2019-12-18 13:56:28,569 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-18 13:56:28,579 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:56:28,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:56:28,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:56:28,588 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:56:28,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,650 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:56:28,691 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:56:28,692 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:56:28,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:56:28,692 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:56:28,692 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:56:28,692 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:56:28,693 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:56:28,693 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:56:28,710 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 13:56:28,713 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:28,823 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:28,824 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:28,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:28,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:28,938 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:28,939 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:28,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:28,965 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 13:56:28,966 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:56:33,336 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 13:56:33,466 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-18 13:56:33,467 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 13:56:33,470 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 13:56:33,909 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-18 13:56:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-18 13:56:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:56:33,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:33,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:56:33,920 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-18 13:56:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:33,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742485386] [2019-12-18 13:56:33,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:34,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742485386] [2019-12-18 13:56:34,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:34,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:34,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078701214] [2019-12-18 13:56:34,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:34,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:34,179 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-18 13:56:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:34,483 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-18 13:56:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:34,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:56:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:34,572 INFO L225 Difference]: With dead ends: 8377 [2019-12-18 13:56:34,572 INFO L226 Difference]: Without dead ends: 8208 [2019-12-18 13:56:34,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-18 13:56:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-18 13:56:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-18 13:56:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-18 13:56:35,033 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-18 13:56:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,033 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-18 13:56:35,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-18 13:56:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:35,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:35,037 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-18 13:56:35,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290962129] [2019-12-18 13:56:35,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290962129] [2019-12-18 13:56:35,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:35,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137777831] [2019-12-18 13:56:35,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:35,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:35,143 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-18 13:56:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,182 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-18 13:56:35,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:35,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:56:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,191 INFO L225 Difference]: With dead ends: 1326 [2019-12-18 13:56:35,191 INFO L226 Difference]: Without dead ends: 1326 [2019-12-18 13:56:35,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-18 13:56:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-18 13:56:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-18 13:56:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-18 13:56:35,240 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-18 13:56:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,240 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-18 13:56:35,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-18 13:56:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:35,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:35,244 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-18 13:56:35,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066709327] [2019-12-18 13:56:35,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066709327] [2019-12-18 13:56:35,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:35,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328537584] [2019-12-18 13:56:35,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:35,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,395 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-18 13:56:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,741 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-18 13:56:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:35,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:56:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,751 INFO L225 Difference]: With dead ends: 1806 [2019-12-18 13:56:35,751 INFO L226 Difference]: Without dead ends: 1806 [2019-12-18 13:56:35,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-18 13:56:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-18 13:56:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 13:56:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-18 13:56:35,803 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-18 13:56:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,803 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-18 13:56:35,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-18 13:56:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:56:35,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,816 INFO L411 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] [2019-12-18 13:56:35,820 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,820 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-18 13:56:35,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712811262] [2019-12-18 13:56:35,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712811262] [2019-12-18 13:56:35,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:35,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145272980] [2019-12-18 13:56:35,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:35,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:35,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,922 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-18 13:56:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,946 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-18 13:56:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:56:35,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 13:56:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,949 INFO L225 Difference]: With dead ends: 356 [2019-12-18 13:56:35,950 INFO L226 Difference]: Without dead ends: 356 [2019-12-18 13:56:35,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-18 13:56:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-18 13:56:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 13:56:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-18 13:56:35,961 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-18 13:56:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,961 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-18 13:56:35,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-18 13:56:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:35,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,964 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:35,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-18 13:56:35,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671038641] [2019-12-18 13:56:35,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671038641] [2019-12-18 13:56:36,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:36,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:36,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280047848] [2019-12-18 13:56:36,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:36,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:36,067 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-18 13:56:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:36,122 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-18 13:56:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:36,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:36,125 INFO L225 Difference]: With dead ends: 331 [2019-12-18 13:56:36,126 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 13:56:36,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 13:56:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-18 13:56:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 13:56:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-18 13:56:36,135 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-18 13:56:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:36,137 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-18 13:56:36,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-18 13:56:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:36,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:36,139 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:36,139 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-18 13:56:36,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:36,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665803719] [2019-12-18 13:56:36,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:36,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665803719] [2019-12-18 13:56:36,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:36,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:56:36,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340728274] [2019-12-18 13:56:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:36,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:36,282 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-18 13:56:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:36,514 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-18 13:56:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:56:36,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 13:56:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:36,518 INFO L225 Difference]: With dead ends: 458 [2019-12-18 13:56:36,518 INFO L226 Difference]: Without dead ends: 458 [2019-12-18 13:56:36,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-18 13:56:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-18 13:56:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-18 13:56:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-18 13:56:36,528 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-18 13:56:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:36,528 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-18 13:56:36,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-18 13:56:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:36,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:36,530 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:36,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-18 13:56:36,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:36,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636109642] [2019-12-18 13:56:36,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:36,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636109642] [2019-12-18 13:56:36,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:36,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:36,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287491908] [2019-12-18 13:56:36,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:36,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:36,660 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-18 13:56:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:36,971 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-18 13:56:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:56:36,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 13:56:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:36,975 INFO L225 Difference]: With dead ends: 513 [2019-12-18 13:56:36,975 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 13:56:36,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:56:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 13:56:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-18 13:56:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 13:56:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-18 13:56:36,986 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-18 13:56:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:36,987 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-18 13:56:36,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-18 13:56:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:36,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:36,988 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:36,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-18 13:56:36,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:36,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039136978] [2019-12-18 13:56:36,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039136978] [2019-12-18 13:56:37,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:37,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315805182] [2019-12-18 13:56:37,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:37,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:37,085 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-18 13:56:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,447 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-18 13:56:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:56:37,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 13:56:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,451 INFO L225 Difference]: With dead ends: 694 [2019-12-18 13:56:37,452 INFO L226 Difference]: Without dead ends: 694 [2019-12-18 13:56:37,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:56:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-18 13:56:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-18 13:56:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-18 13:56:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-18 13:56:37,464 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-18 13:56:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,465 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-18 13:56:37,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-18 13:56:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:37,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,466 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:37,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-18 13:56:37,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435853221] [2019-12-18 13:56:37,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435853221] [2019-12-18 13:56:37,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:37,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108218718] [2019-12-18 13:56:37,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:37,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,518 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-18 13:56:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,531 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-18 13:56:37,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:37,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,534 INFO L225 Difference]: With dead ends: 406 [2019-12-18 13:56:37,534 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 13:56:37,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 13:56:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-18 13:56:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 13:56:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-18 13:56:37,544 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-18 13:56:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,544 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-18 13:56:37,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-18 13:56:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:56:37,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,546 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:37,546 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-18 13:56:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978183315] [2019-12-18 13:56:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978183315] [2019-12-18 13:56:37,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:56:37,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732787004] [2019-12-18 13:56:37,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:56:37,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:56:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:56:37,749 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 8 states. [2019-12-18 13:56:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:38,265 INFO L93 Difference]: Finished difference Result 677 states and 1203 transitions. [2019-12-18 13:56:38,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:56:38,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 13:56:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:38,270 INFO L225 Difference]: With dead ends: 677 [2019-12-18 13:56:38,270 INFO L226 Difference]: Without dead ends: 677 [2019-12-18 13:56:38,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:56:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-18 13:56:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 362. [2019-12-18 13:56:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-18 13:56:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 654 transitions. [2019-12-18 13:56:38,281 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 654 transitions. Word has length 53 [2019-12-18 13:56:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:38,282 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 654 transitions. [2019-12-18 13:56:38,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:56:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 654 transitions. [2019-12-18 13:56:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:56:38,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:38,283 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:38,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash -162355984, now seen corresponding path program 2 times [2019-12-18 13:56:38,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:38,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103098663] [2019-12-18 13:56:38,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:38,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103098663] [2019-12-18 13:56:38,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:38,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:38,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035183177] [2019-12-18 13:56:38,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:38,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:38,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:38,374 INFO L87 Difference]: Start difference. First operand 362 states and 654 transitions. Second operand 3 states. [2019-12-18 13:56:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:38,413 INFO L93 Difference]: Finished difference Result 362 states and 653 transitions. [2019-12-18 13:56:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:38,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 13:56:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:38,416 INFO L225 Difference]: With dead ends: 362 [2019-12-18 13:56:38,416 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 13:56:38,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 13:56:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 275. [2019-12-18 13:56:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-18 13:56:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 491 transitions. [2019-12-18 13:56:38,428 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 491 transitions. Word has length 53 [2019-12-18 13:56:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:38,428 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 491 transitions. [2019-12-18 13:56:38,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 491 transitions. [2019-12-18 13:56:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:38,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:38,429 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:38,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1221221950, now seen corresponding path program 1 times [2019-12-18 13:56:38,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:38,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185653089] [2019-12-18 13:56:38,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:38,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185653089] [2019-12-18 13:56:38,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:38,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:56:38,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491146552] [2019-12-18 13:56:38,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:38,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:38,567 INFO L87 Difference]: Start difference. First operand 275 states and 491 transitions. Second operand 6 states. [2019-12-18 13:56:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:38,629 INFO L93 Difference]: Finished difference Result 455 states and 804 transitions. [2019-12-18 13:56:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:56:38,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 13:56:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:38,631 INFO L225 Difference]: With dead ends: 455 [2019-12-18 13:56:38,631 INFO L226 Difference]: Without dead ends: 197 [2019-12-18 13:56:38,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:56:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-18 13:56:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-12-18 13:56:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 13:56:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 339 transitions. [2019-12-18 13:56:38,636 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 339 transitions. Word has length 54 [2019-12-18 13:56:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 339 transitions. [2019-12-18 13:56:38,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 339 transitions. [2019-12-18 13:56:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:38,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:38,638 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:38,638 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 2 times [2019-12-18 13:56:38,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:38,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978604609] [2019-12-18 13:56:38,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:38,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978604609] [2019-12-18 13:56:38,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:38,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:56:38,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764153267] [2019-12-18 13:56:38,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:56:38,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:38,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:56:38,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:56:38,959 INFO L87 Difference]: Start difference. First operand 197 states and 339 transitions. Second operand 14 states. [2019-12-18 13:56:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:39,545 INFO L93 Difference]: Finished difference Result 366 states and 620 transitions. [2019-12-18 13:56:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:56:39,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 13:56:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:39,548 INFO L225 Difference]: With dead ends: 366 [2019-12-18 13:56:39,549 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 13:56:39,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-18 13:56:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 13:56:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-18 13:56:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-18 13:56:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 510 transitions. [2019-12-18 13:56:39,557 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 510 transitions. Word has length 54 [2019-12-18 13:56:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:39,557 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 510 transitions. [2019-12-18 13:56:39,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:56:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 510 transitions. [2019-12-18 13:56:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:39,558 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:39,559 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 3 times [2019-12-18 13:56:39,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186942708] [2019-12-18 13:56:39,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:39,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186942708] [2019-12-18 13:56:39,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:39,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:56:39,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231985807] [2019-12-18 13:56:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:56:39,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:56:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:56:39,782 INFO L87 Difference]: Start difference. First operand 297 states and 510 transitions. Second operand 12 states. [2019-12-18 13:56:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:40,102 INFO L93 Difference]: Finished difference Result 400 states and 668 transitions. [2019-12-18 13:56:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:56:40,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 13:56:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:40,105 INFO L225 Difference]: With dead ends: 400 [2019-12-18 13:56:40,105 INFO L226 Difference]: Without dead ends: 367 [2019-12-18 13:56:40,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:56:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-18 13:56:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-18 13:56:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 13:56:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 524 transitions. [2019-12-18 13:56:40,112 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 524 transitions. Word has length 54 [2019-12-18 13:56:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:40,113 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 524 transitions. [2019-12-18 13:56:40,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:56:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 524 transitions. [2019-12-18 13:56:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:40,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:40,114 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:40,114 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 4 times [2019-12-18 13:56:40,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:40,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354316191] [2019-12-18 13:56:40,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:40,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:56:40,212 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:56:40,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:56:40,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:56:40,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:56:40,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1141417641 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1141417641 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1141417641| |P0Thread1of1ForFork0_#t~ite3_Out-1141417641|))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-1141417641| ~x~0_In-1141417641)) (and (not .cse1) (= ~x$w_buff1~0_In-1141417641 |P0Thread1of1ForFork0_#t~ite3_Out-1141417641|) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1141417641, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141417641, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141417641, ~x~0=~x~0_In-1141417641} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1141417641|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1141417641|, ~x$w_buff1~0=~x$w_buff1~0_In-1141417641, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141417641, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141417641, ~x~0=~x~0_In-1141417641} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:56:40,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-233486814 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-233486814 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-233486814 |P0Thread1of1ForFork0_#t~ite5_Out-233486814|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-233486814|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-233486814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-233486814} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-233486814|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-233486814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-233486814} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:56:40,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In193019533 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In193019533 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In193019533 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In193019533 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out193019533|)) (and (= ~x$w_buff1_used~0_In193019533 |P0Thread1of1ForFork0_#t~ite6_Out193019533|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In193019533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193019533, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In193019533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193019533} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out193019533|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In193019533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193019533, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In193019533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193019533} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:56:40,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1697853416 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1697853416 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1697853416| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1697853416 |P1Thread1of1ForFork1_#t~ite11_Out1697853416|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1697853416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1697853416} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1697853416|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1697853416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1697853416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:56:40,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-829115763 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-829115763 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-829115763 |P0Thread1of1ForFork0_#t~ite7_Out-829115763|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-829115763|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829115763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829115763} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829115763, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-829115763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829115763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:56:40,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-639612309 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-639612309 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-639612309 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-639612309 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-639612309| ~x$r_buff1_thd1~0_In-639612309) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-639612309| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-639612309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-639612309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-639612309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-639612309} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-639612309, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-639612309|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-639612309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-639612309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-639612309} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:56:40,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:56:40,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1332905081 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1332905081 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1332905081 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1332905081 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1332905081| ~x$w_buff1_used~0_In1332905081) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out1332905081| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1332905081, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1332905081, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1332905081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1332905081} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1332905081, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1332905081, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1332905081|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1332905081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1332905081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:56:40,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1649612801 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1649612801 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1649612801 ~x$r_buff0_thd2~0_In1649612801)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out1649612801 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1649612801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1649612801} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1649612801|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1649612801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1649612801} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:56:40,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1556537989 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1556537989 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1556537989 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1556537989 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1556537989 |P1Thread1of1ForFork1_#t~ite14_Out-1556537989|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1556537989|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556537989, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1556537989, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1556537989, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556537989} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556537989, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1556537989, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1556537989, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1556537989|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1556537989} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:56:40,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:56:40,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:56:40,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-497357973 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-497357973 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out-497357973| |ULTIMATE.start_main_#t~ite18_Out-497357973|))) (or (and (= ~x~0_In-497357973 |ULTIMATE.start_main_#t~ite17_Out-497357973|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-497357973| ~x$w_buff1~0_In-497357973) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-497357973, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497357973, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497357973, ~x~0=~x~0_In-497357973} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-497357973|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-497357973|, ~x$w_buff1~0=~x$w_buff1~0_In-497357973, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497357973, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-497357973, ~x~0=~x~0_In-497357973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 13:56:40,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In2120219967 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2120219967 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2120219967 |ULTIMATE.start_main_#t~ite19_Out2120219967|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out2120219967|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2120219967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120219967} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2120219967, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2120219967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120219967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:56:40,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-367930539 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-367930539 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-367930539 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-367930539 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-367930539| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out-367930539| ~x$w_buff1_used~0_In-367930539) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-367930539, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-367930539, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-367930539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367930539} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-367930539, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-367930539, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-367930539|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-367930539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367930539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:56:40,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-234800844 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-234800844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-234800844| ~x$r_buff0_thd0~0_In-234800844) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-234800844| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-234800844, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-234800844} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-234800844, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-234800844|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-234800844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:56:40,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1807914043 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1807914043 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1807914043 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1807914043 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1807914043|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out-1807914043| ~x$r_buff1_thd0~0_In-1807914043) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1807914043, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1807914043, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1807914043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1807914043} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1807914043, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1807914043, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1807914043, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1807914043|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1807914043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:56:40,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In6333378 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out6333378| |ULTIMATE.start_main_#t~ite32_Out6333378|) .cse0 (= |ULTIMATE.start_main_#t~ite31_Out6333378| ~x$w_buff1~0_In6333378) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In6333378 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In6333378 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In6333378 256))) (= 0 (mod ~x$w_buff0_used~0_In6333378 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In6333378| |ULTIMATE.start_main_#t~ite31_Out6333378|) (= |ULTIMATE.start_main_#t~ite32_Out6333378| ~x$w_buff1~0_In6333378)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In6333378, ~x$w_buff1~0=~x$w_buff1~0_In6333378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In6333378, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In6333378, ~weak$$choice2~0=~weak$$choice2~0_In6333378, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In6333378|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6333378} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In6333378, ~x$w_buff1~0=~x$w_buff1~0_In6333378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In6333378, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out6333378|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In6333378, ~weak$$choice2~0=~weak$$choice2~0_In6333378, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out6333378|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6333378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 13:56:40,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:56:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:56:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:56:40,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:56:40 BasicIcfg [2019-12-18 13:56:40,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:56:40,305 INFO L168 Benchmark]: Toolchain (without parser) took 13403.77 ms. Allocated memory was 137.9 MB in the beginning and 382.2 MB in the end (delta: 244.3 MB). Free memory was 100.9 MB in the beginning and 102.5 MB in the end (delta: -1.6 MB). Peak memory consumption was 242.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,307 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:56:40,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.78 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.52 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,309 INFO L168 Benchmark]: Boogie Preprocessor took 41.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,310 INFO L168 Benchmark]: RCFGBuilder took 774.95 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,310 INFO L168 Benchmark]: TraceAbstraction took 11736.04 ms. Allocated memory was 202.4 MB in the beginning and 382.2 MB in the end (delta: 179.8 MB). Free memory was 106.3 MB in the beginning and 102.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:40,318 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.78 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.52 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.95 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11736.04 ms. Allocated memory was 202.4 MB in the beginning and 382.2 MB in the end (delta: 179.8 MB). Free memory was 106.3 MB in the beginning and 102.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 183.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1376 SDtfs, 1295 SDslu, 3040 SDs, 0 SdLazy, 1777 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 93148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...