/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:03:51,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:03:51,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:03:51,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:03:51,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:03:51,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:03:51,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:03:51,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:03:51,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:03:51,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:03:51,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:03:51,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:03:51,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:03:51,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:03:51,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:03:51,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:03:51,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:03:51,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:03:51,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:03:51,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:03:51,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:03:51,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:03:51,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:03:51,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:03:51,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:03:51,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:03:51,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:03:51,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:03:51,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:03:51,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:03:51,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:03:51,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:03:51,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:03:51,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:03:51,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:03:51,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:03:51,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:03:51,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:03:51,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:03:51,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:03:51,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:03:51,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:03:51,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:03:51,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:03:51,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:03:51,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:03:51,880 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:03:51,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:03:51,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:03:51,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:03:51,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:03:51,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:03:51,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:03:51,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:03:51,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:03:51,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:03:51,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:03:51,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:03:51,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:03:51,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:03:51,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:03:51,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:03:51,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:03:51,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:03:51,885 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:03:51,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:03:51,885 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:03:51,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:03:52,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:03:52,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:03:52,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:03:52,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:03:52,178 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:03:52,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-27 17:03:52,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c16147d/64d3f321ab27441e881a706d8b7c3031/FLAGe7211d4a4 [2019-12-27 17:03:52,788 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:03:52,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-27 17:03:52,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c16147d/64d3f321ab27441e881a706d8b7c3031/FLAGe7211d4a4 [2019-12-27 17:03:53,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c16147d/64d3f321ab27441e881a706d8b7c3031 [2019-12-27 17:03:53,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:03:53,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:03:53,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:53,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:03:53,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:03:53,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53, skipping insertion in model container [2019-12-27 17:03:53,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:03:53,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:03:53,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:53,702 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:03:53,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:53,887 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:03:53,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53 WrapperNode [2019-12-27 17:03:53,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:53,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:53,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:03:53,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:03:53,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:53,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:03:53,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:03:53,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:03:53,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:53,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (1/1) ... [2019-12-27 17:03:54,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:03:54,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:03:54,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:03:54,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:03:54,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (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-27 17:03:54,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:03:54,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:03:54,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:03:54,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:03:54,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:03:54,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:03:54,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:03:54,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:03:54,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:03:54,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:03:54,069 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:03:54,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:03:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:03:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:03:54,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:03:54,072 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:03:54,781 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:03:54,781 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:03:54,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:54 BoogieIcfgContainer [2019-12-27 17:03:54,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:03:54,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:03:54,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:03:54,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:03:54,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:03:53" (1/3) ... [2019-12-27 17:03:54,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edeb8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:54, skipping insertion in model container [2019-12-27 17:03:54,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:53" (2/3) ... [2019-12-27 17:03:54,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edeb8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:54, skipping insertion in model container [2019-12-27 17:03:54,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:54" (3/3) ... [2019-12-27 17:03:54,792 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-27 17:03:54,802 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:03:54,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:03:54,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:03:54,812 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:03:54,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,858 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,858 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,867 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,867 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,868 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,868 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,868 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,918 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,918 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,921 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,921 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,923 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:54,939 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:03:54,958 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:03:54,958 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:03:54,959 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:03:54,959 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:03:54,959 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:03:54,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:03:54,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:03:54,959 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:03:54,977 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 17:03:54,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 17:03:55,077 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 17:03:55,078 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:55,092 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:03:55,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 17:03:55,165 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 17:03:55,166 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:55,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:03:55,188 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:03:55,189 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:03:58,542 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-27 17:04:00,702 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 17:04:00,876 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 17:04:00,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-27 17:04:00,902 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-27 17:04:00,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 17:04:02,900 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-27 17:04:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-27 17:04:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:04:02,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:02,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:02,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-27 17:04:02,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:02,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278341921] [2019-12-27 17:04:02,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:03,217 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-27 17:04:03,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278341921] [2019-12-27 17:04:03,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:03,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:04:03,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640480977] [2019-12-27 17:04:03,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:03,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:03,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:04:03,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:03,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:03,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:03,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:03,274 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-27 17:04:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:04,404 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-27 17:04:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:04,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:04:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:04,703 INFO L225 Difference]: With dead ends: 33638 [2019-12-27 17:04:04,703 INFO L226 Difference]: Without dead ends: 32966 [2019-12-27 17:04:04,705 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-27 17:04:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-27 17:04:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-27 17:04:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-27 17:04:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-27 17:04:06,641 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-27 17:04:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:06,642 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-27 17:04:06,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-27 17:04:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:04:06,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:06,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:06,656 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-27 17:04:06,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:06,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008531397] [2019-12-27 17:04:06,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:06,854 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-27 17:04:06,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008531397] [2019-12-27 17:04:06,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:06,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:06,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1558408777] [2019-12-27 17:04:06,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:06,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:06,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:04:06,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:06,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:04:06,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:04:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:04:06,870 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-27 17:04:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:07,330 INFO L93 Difference]: Finished difference Result 26803 states and 105582 transitions. [2019-12-27 17:04:07,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:04:07,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 17:04:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:07,495 INFO L225 Difference]: With dead ends: 26803 [2019-12-27 17:04:07,496 INFO L226 Difference]: Without dead ends: 26131 [2019-12-27 17:04:07,497 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-27 17:04:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26131 states. [2019-12-27 17:04:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26131 to 26131. [2019-12-27 17:04:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26131 states. [2019-12-27 17:04:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26131 states to 26131 states and 103371 transitions. [2019-12-27 17:04:10,144 INFO L78 Accepts]: Start accepts. Automaton has 26131 states and 103371 transitions. Word has length 15 [2019-12-27 17:04:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:10,145 INFO L462 AbstractCegarLoop]: Abstraction has 26131 states and 103371 transitions. [2019-12-27 17:04:10,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:04:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26131 states and 103371 transitions. [2019-12-27 17:04:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:04:10,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:10,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:10,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-27 17:04:10,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:10,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540652428] [2019-12-27 17:04:10,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:10,242 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-27 17:04:10,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540652428] [2019-12-27 17:04:10,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:10,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:10,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153768390] [2019-12-27 17:04:10,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:10,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:10,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:04:10,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:10,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:10,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:10,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:10,311 INFO L87 Difference]: Start difference. First operand 26131 states and 103371 transitions. Second operand 5 states. [2019-12-27 17:04:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:11,180 INFO L93 Difference]: Finished difference Result 40316 states and 153785 transitions. [2019-12-27 17:04:11,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:04:11,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:04:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:11,299 INFO L225 Difference]: With dead ends: 40316 [2019-12-27 17:04:11,299 INFO L226 Difference]: Without dead ends: 40243 [2019-12-27 17:04:11,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-27 17:04:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 36697. [2019-12-27 17:04:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36697 states. [2019-12-27 17:04:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36697 states to 36697 states and 141605 transitions. [2019-12-27 17:04:12,798 INFO L78 Accepts]: Start accepts. Automaton has 36697 states and 141605 transitions. Word has length 15 [2019-12-27 17:04:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:12,798 INFO L462 AbstractCegarLoop]: Abstraction has 36697 states and 141605 transitions. [2019-12-27 17:04:12,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 36697 states and 141605 transitions. [2019-12-27 17:04:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:04:12,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:12,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:12,802 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1848543703, now seen corresponding path program 1 times [2019-12-27 17:04:12,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:12,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826729678] [2019-12-27 17:04:12,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:12,875 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-27 17:04:12,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826729678] [2019-12-27 17:04:12,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:12,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:12,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540495112] [2019-12-27 17:04:12,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:12,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:12,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:04:12,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:12,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:12,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:12,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:12,885 INFO L87 Difference]: Start difference. First operand 36697 states and 141605 transitions. Second operand 5 states. [2019-12-27 17:04:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:13,022 INFO L93 Difference]: Finished difference Result 16211 states and 51919 transitions. [2019-12-27 17:04:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:04:13,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:04:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:13,047 INFO L225 Difference]: With dead ends: 16211 [2019-12-27 17:04:13,047 INFO L226 Difference]: Without dead ends: 15335 [2019-12-27 17:04:13,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2019-12-27 17:04:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 15335. [2019-12-27 17:04:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15335 states. [2019-12-27 17:04:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 49121 transitions. [2019-12-27 17:04:14,811 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 49121 transitions. Word has length 16 [2019-12-27 17:04:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:14,811 INFO L462 AbstractCegarLoop]: Abstraction has 15335 states and 49121 transitions. [2019-12-27 17:04:14,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 49121 transitions. [2019-12-27 17:04:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:04:14,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:14,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:14,815 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash -114600186, now seen corresponding path program 1 times [2019-12-27 17:04:14,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:14,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205506778] [2019-12-27 17:04:14,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:14,944 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-27 17:04:14,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205506778] [2019-12-27 17:04:14,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:14,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:14,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [769791043] [2019-12-27 17:04:14,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:14,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:14,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:04:14,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:15,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:04:15,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:04:15,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:04:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:04:15,019 INFO L87 Difference]: Start difference. First operand 15335 states and 49121 transitions. Second operand 8 states. [2019-12-27 17:04:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:15,135 INFO L93 Difference]: Finished difference Result 3025 states and 7918 transitions. [2019-12-27 17:04:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:04:15,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 17:04:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:15,140 INFO L225 Difference]: With dead ends: 3025 [2019-12-27 17:04:15,140 INFO L226 Difference]: Without dead ends: 2656 [2019-12-27 17:04:15,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-12-27 17:04:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2656. [2019-12-27 17:04:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-12-27 17:04:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 6880 transitions. [2019-12-27 17:04:15,189 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 6880 transitions. Word has length 17 [2019-12-27 17:04:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:15,190 INFO L462 AbstractCegarLoop]: Abstraction has 2656 states and 6880 transitions. [2019-12-27 17:04:15,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:04:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 6880 transitions. [2019-12-27 17:04:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:04:15,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:15,194 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] [2019-12-27 17:04:15,195 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -551898513, now seen corresponding path program 1 times [2019-12-27 17:04:15,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616719180] [2019-12-27 17:04:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:15,354 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-27 17:04:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616719180] [2019-12-27 17:04:15,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:15,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:15,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750538887] [2019-12-27 17:04:15,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:15,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:15,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 261 transitions. [2019-12-27 17:04:15,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:15,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:04:15,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:04:15,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:04:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:15,442 INFO L87 Difference]: Start difference. First operand 2656 states and 6880 transitions. Second operand 6 states. [2019-12-27 17:04:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:15,802 INFO L93 Difference]: Finished difference Result 3109 states and 7786 transitions. [2019-12-27 17:04:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:04:15,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 17:04:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:15,806 INFO L225 Difference]: With dead ends: 3109 [2019-12-27 17:04:15,806 INFO L226 Difference]: Without dead ends: 3109 [2019-12-27 17:04:15,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:04:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-12-27 17:04:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2899. [2019-12-27 17:04:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2019-12-27 17:04:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 7379 transitions. [2019-12-27 17:04:15,839 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 7379 transitions. Word has length 29 [2019-12-27 17:04:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:15,839 INFO L462 AbstractCegarLoop]: Abstraction has 2899 states and 7379 transitions. [2019-12-27 17:04:15,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:04:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 7379 transitions. [2019-12-27 17:04:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 17:04:15,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:15,846 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] [2019-12-27 17:04:15,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash 456235861, now seen corresponding path program 1 times [2019-12-27 17:04:15,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:15,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008311689] [2019-12-27 17:04:15,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:15,899 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-27 17:04:15,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008311689] [2019-12-27 17:04:15,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:15,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:15,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1189886963] [2019-12-27 17:04:15,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:15,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:16,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 275 transitions. [2019-12-27 17:04:16,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:16,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:16,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:16,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:16,100 INFO L87 Difference]: Start difference. First operand 2899 states and 7379 transitions. Second operand 3 states. [2019-12-27 17:04:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:16,163 INFO L93 Difference]: Finished difference Result 3294 states and 8173 transitions. [2019-12-27 17:04:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:16,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-27 17:04:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:16,167 INFO L225 Difference]: With dead ends: 3294 [2019-12-27 17:04:16,167 INFO L226 Difference]: Without dead ends: 3294 [2019-12-27 17:04:16,167 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-27 17:04:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-12-27 17:04:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3067. [2019-12-27 17:04:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-12-27 17:04:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 7724 transitions. [2019-12-27 17:04:16,213 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 7724 transitions. Word has length 43 [2019-12-27 17:04:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:16,216 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 7724 transitions. [2019-12-27 17:04:16,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 7724 transitions. [2019-12-27 17:04:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 17:04:16,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:16,225 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] [2019-12-27 17:04:16,226 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:16,226 INFO L82 PathProgramCache]: Analyzing trace with hash 239744664, now seen corresponding path program 1 times [2019-12-27 17:04:16,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:16,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122172387] [2019-12-27 17:04:16,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:16,336 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-27 17:04:16,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122172387] [2019-12-27 17:04:16,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:16,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:16,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192005092] [2019-12-27 17:04:16,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:16,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:16,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 275 transitions. [2019-12-27 17:04:16,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:16,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:04:16,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:04:16,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:04:16,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:16,439 INFO L87 Difference]: Start difference. First operand 3067 states and 7724 transitions. Second operand 9 states. [2019-12-27 17:04:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:16,580 INFO L93 Difference]: Finished difference Result 1341 states and 3750 transitions. [2019-12-27 17:04:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:04:16,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-27 17:04:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:16,584 INFO L225 Difference]: With dead ends: 1341 [2019-12-27 17:04:16,584 INFO L226 Difference]: Without dead ends: 1292 [2019-12-27 17:04:16,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:04:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-27 17:04:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-27 17:04:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-27 17:04:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3334 transitions. [2019-12-27 17:04:16,603 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3334 transitions. Word has length 43 [2019-12-27 17:04:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:16,603 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3334 transitions. [2019-12-27 17:04:16,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:04:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3334 transitions. [2019-12-27 17:04:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:04:16,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:16,607 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, 1, 1, 1, 1] [2019-12-27 17:04:16,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1145943377, now seen corresponding path program 1 times [2019-12-27 17:04:16,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:16,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613668808] [2019-12-27 17:04:16,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:16,756 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-27 17:04:16,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613668808] [2019-12-27 17:04:16,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:16,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:16,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125357011] [2019-12-27 17:04:16,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:16,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:16,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 218 transitions. [2019-12-27 17:04:16,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:16,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:04:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:16,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:16,944 INFO L87 Difference]: Start difference. First operand 1180 states and 3334 transitions. Second operand 5 states. [2019-12-27 17:04:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:17,164 INFO L93 Difference]: Finished difference Result 1506 states and 4151 transitions. [2019-12-27 17:04:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:04:17,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:04:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:17,167 INFO L225 Difference]: With dead ends: 1506 [2019-12-27 17:04:17,168 INFO L226 Difference]: Without dead ends: 1506 [2019-12-27 17:04:17,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-12-27 17:04:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1132. [2019-12-27 17:04:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-27 17:04:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3142 transitions. [2019-12-27 17:04:17,183 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 3142 transitions. Word has length 58 [2019-12-27 17:04:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:17,184 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 3142 transitions. [2019-12-27 17:04:17,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3142 transitions. [2019-12-27 17:04:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:04:17,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:17,190 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, 1, 1, 1, 1, 1] [2019-12-27 17:04:17,190 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1681867632, now seen corresponding path program 1 times [2019-12-27 17:04:17,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:17,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332161218] [2019-12-27 17:04:17,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:17,321 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-27 17:04:17,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332161218] [2019-12-27 17:04:17,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:17,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:17,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1560535730] [2019-12-27 17:04:17,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:17,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:17,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 218 transitions. [2019-12-27 17:04:17,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:17,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:17,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:17,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:17,507 INFO L87 Difference]: Start difference. First operand 1132 states and 3142 transitions. Second operand 5 states. [2019-12-27 17:04:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:17,701 INFO L93 Difference]: Finished difference Result 1669 states and 4648 transitions. [2019-12-27 17:04:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:04:17,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 17:04:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:17,704 INFO L225 Difference]: With dead ends: 1669 [2019-12-27 17:04:17,704 INFO L226 Difference]: Without dead ends: 1669 [2019-12-27 17:04:17,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-27 17:04:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-12-27 17:04:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1469. [2019-12-27 17:04:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-27 17:04:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 4088 transitions. [2019-12-27 17:04:17,724 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 4088 transitions. Word has length 59 [2019-12-27 17:04:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:17,724 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 4088 transitions. [2019-12-27 17:04:17,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 4088 transitions. [2019-12-27 17:04:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:04:17,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:17,728 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, 1, 1, 1, 1, 1] [2019-12-27 17:04:17,728 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash 392774434, now seen corresponding path program 2 times [2019-12-27 17:04:17,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:17,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251047362] [2019-12-27 17:04:17,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:17,824 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-27 17:04:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251047362] [2019-12-27 17:04:17,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:17,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:17,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966572099] [2019-12-27 17:04:17,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:17,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:17,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 257 transitions. [2019-12-27 17:04:17,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:17,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:17,947 INFO L87 Difference]: Start difference. First operand 1469 states and 4088 transitions. Second operand 3 states. [2019-12-27 17:04:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:18,021 INFO L93 Difference]: Finished difference Result 1469 states and 4087 transitions. [2019-12-27 17:04:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:18,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 17:04:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:18,024 INFO L225 Difference]: With dead ends: 1469 [2019-12-27 17:04:18,025 INFO L226 Difference]: Without dead ends: 1469 [2019-12-27 17:04:18,025 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-27 17:04:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-12-27 17:04:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1132. [2019-12-27 17:04:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-27 17:04:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3141 transitions. [2019-12-27 17:04:18,043 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 3141 transitions. Word has length 59 [2019-12-27 17:04:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:18,043 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 3141 transitions. [2019-12-27 17:04:18,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3141 transitions. [2019-12-27 17:04:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:18,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:18,046 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, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:18,047 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1028151268, now seen corresponding path program 1 times [2019-12-27 17:04:18,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:18,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024287430] [2019-12-27 17:04:18,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:18,164 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-27 17:04:18,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024287430] [2019-12-27 17:04:18,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:18,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:18,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486620273] [2019-12-27 17:04:18,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:18,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:18,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 215 transitions. [2019-12-27 17:04:18,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:18,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:18,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:04:18,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:04:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:18,263 INFO L87 Difference]: Start difference. First operand 1132 states and 3141 transitions. Second operand 6 states. [2019-12-27 17:04:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:18,330 INFO L93 Difference]: Finished difference Result 1603 states and 4186 transitions. [2019-12-27 17:04:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:04:18,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 17:04:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:18,333 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 17:04:18,333 INFO L226 Difference]: Without dead ends: 1006 [2019-12-27 17:04:18,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-27 17:04:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-27 17:04:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2019-12-27 17:04:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-12-27 17:04:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2717 transitions. [2019-12-27 17:04:18,347 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2717 transitions. Word has length 60 [2019-12-27 17:04:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:18,347 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 2717 transitions. [2019-12-27 17:04:18,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:04:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2717 transitions. [2019-12-27 17:04:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:18,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:18,349 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, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:18,349 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 2 times [2019-12-27 17:04:18,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:18,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019268810] [2019-12-27 17:04:18,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:18,457 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-27 17:04:18,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019268810] [2019-12-27 17:04:18,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:18,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:18,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221806846] [2019-12-27 17:04:18,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:18,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:18,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 258 transitions. [2019-12-27 17:04:18,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:04:18,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:04:18,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:18,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:18,758 INFO L87 Difference]: Start difference. First operand 1006 states and 2717 transitions. Second operand 11 states. [2019-12-27 17:04:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:19,176 INFO L93 Difference]: Finished difference Result 1933 states and 4948 transitions. [2019-12-27 17:04:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:04:19,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-12-27 17:04:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:19,178 INFO L225 Difference]: With dead ends: 1933 [2019-12-27 17:04:19,178 INFO L226 Difference]: Without dead ends: 812 [2019-12-27 17:04:19,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:04:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-12-27 17:04:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 566. [2019-12-27 17:04:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-12-27 17:04:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1234 transitions. [2019-12-27 17:04:19,188 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1234 transitions. Word has length 60 [2019-12-27 17:04:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:19,188 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 1234 transitions. [2019-12-27 17:04:19,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1234 transitions. [2019-12-27 17:04:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:19,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:19,190 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, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:19,190 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 3 times [2019-12-27 17:04:19,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:19,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138335284] [2019-12-27 17:04:19,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:19,428 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-27 17:04:19,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138335284] [2019-12-27 17:04:19,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:19,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:04:19,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305913614] [2019-12-27 17:04:19,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:19,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:19,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 109 transitions. [2019-12-27 17:04:19,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:19,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:04:19,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:04:19,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:04:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:04:19,597 INFO L87 Difference]: Start difference. First operand 566 states and 1234 transitions. Second operand 14 states. [2019-12-27 17:04:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:21,211 INFO L93 Difference]: Finished difference Result 1355 states and 2936 transitions. [2019-12-27 17:04:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:04:21,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 17:04:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:21,213 INFO L225 Difference]: With dead ends: 1355 [2019-12-27 17:04:21,213 INFO L226 Difference]: Without dead ends: 1321 [2019-12-27 17:04:21,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:04:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-27 17:04:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 754. [2019-12-27 17:04:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:04:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1651 transitions. [2019-12-27 17:04:21,226 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1651 transitions. Word has length 60 [2019-12-27 17:04:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:21,226 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1651 transitions. [2019-12-27 17:04:21,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:04:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1651 transitions. [2019-12-27 17:04:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:21,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:21,227 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, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:21,227 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1887301962, now seen corresponding path program 4 times [2019-12-27 17:04:21,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:21,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206366285] [2019-12-27 17:04:21,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:21,457 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-27 17:04:21,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206366285] [2019-12-27 17:04:21,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:21,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:04:21,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135098032] [2019-12-27 17:04:21,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:21,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:21,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 102 transitions. [2019-12-27 17:04:21,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:21,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:21,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:04:21,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:21,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:04:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:04:21,545 INFO L87 Difference]: Start difference. First operand 754 states and 1651 transitions. Second operand 13 states. [2019-12-27 17:04:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:21,869 INFO L93 Difference]: Finished difference Result 914 states and 1957 transitions. [2019-12-27 17:04:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:04:21,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 17:04:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:21,871 INFO L225 Difference]: With dead ends: 914 [2019-12-27 17:04:21,872 INFO L226 Difference]: Without dead ends: 880 [2019-12-27 17:04:21,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:04:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-27 17:04:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 770. [2019-12-27 17:04:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 17:04:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1687 transitions. [2019-12-27 17:04:21,882 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1687 transitions. Word has length 60 [2019-12-27 17:04:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1687 transitions. [2019-12-27 17:04:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:04:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1687 transitions. [2019-12-27 17:04:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:21,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:21,884 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, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:21,884 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 5 times [2019-12-27 17:04:21,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:21,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100539338] [2019-12-27 17:04:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:22,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:04:22,020 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:04:22,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:22,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-27 17:04:22,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-27 17:04:22,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 17:04:22,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd4~0_Out-1156006691 ~z$r_buff0_thd4~0_In-1156006691) (= ~a~0_Out-1156006691 ~__unbuffered_p3_EAX~0_Out-1156006691) (= 1 ~z$r_buff0_thd4~0_Out-1156006691) (= ~z$r_buff0_thd3~0_In-1156006691 ~z$r_buff1_thd3~0_Out-1156006691) (= ~z$r_buff1_thd2~0_Out-1156006691 ~z$r_buff0_thd2~0_In-1156006691) (= ~z$r_buff0_thd1~0_In-1156006691 ~z$r_buff1_thd1~0_Out-1156006691) (= ~a~0_Out-1156006691 1) (= ~__unbuffered_p3_EBX~0_Out-1156006691 ~b~0_In-1156006691) (= ~z$r_buff0_thd0~0_In-1156006691 ~z$r_buff1_thd0~0_Out-1156006691) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1156006691))) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1156006691, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1156006691, ~b~0=~b~0_In-1156006691, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1156006691, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1156006691, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1156006691, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1156006691} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1156006691, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1156006691, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1156006691, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1156006691, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1156006691, ~a~0=~a~0_Out-1156006691, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1156006691, ~b~0=~b~0_In-1156006691, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1156006691, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1156006691, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1156006691, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1156006691, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1156006691, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1156006691, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1156006691} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 17:04:22,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:04:22,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:04:22,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In955224650 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In955224650 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out955224650|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In955224650 |P3Thread1of1ForFork3_#t~ite11_Out955224650|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In955224650, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In955224650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In955224650, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In955224650, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out955224650|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 17:04:22,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1256563830 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1256563830 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1256563830 |P2Thread1of1ForFork2_#t~ite3_Out1256563830|)) (and (or .cse1 .cse0) (= ~z~0_In1256563830 |P2Thread1of1ForFork2_#t~ite3_Out1256563830|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1256563830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1256563830, ~z$w_buff1~0=~z$w_buff1~0_In1256563830, ~z~0=~z~0_In1256563830} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1256563830|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1256563830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1256563830, ~z$w_buff1~0=~z$w_buff1~0_In1256563830, ~z~0=~z~0_In1256563830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:04:22,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 17:04:22,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2037061827 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2037061827 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out2037061827|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2037061827 |P2Thread1of1ForFork2_#t~ite5_Out2037061827|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2037061827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2037061827} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out2037061827|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2037061827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2037061827} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:04:22,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In435026865 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In435026865 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In435026865 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In435026865 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out435026865|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In435026865 |P2Thread1of1ForFork2_#t~ite6_Out435026865|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In435026865, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In435026865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In435026865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In435026865} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out435026865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In435026865, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In435026865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In435026865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In435026865} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:04:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1930461048 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1930461048 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1930461048| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1930461048| ~z$r_buff0_thd3~0_In-1930461048)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930461048, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1930461048} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930461048, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1930461048, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1930461048|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:04:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In1608540385 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1608540385 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1608540385 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1608540385 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1608540385 |P2Thread1of1ForFork2_#t~ite8_Out1608540385|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out1608540385| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1608540385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1608540385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1608540385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1608540385} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1608540385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1608540385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1608540385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1608540385, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1608540385|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:04:22,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:04:22,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-856040228 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-856040228 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-856040228 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-856040228 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite12_Out-856040228| ~z$w_buff1_used~0_In-856040228) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite12_Out-856040228| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-856040228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-856040228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-856040228} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-856040228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-856040228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-856040228, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-856040228|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 17:04:22,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2056194379 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2056194379 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-2056194379 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-2056194379 ~z$r_buff0_thd4~0_In-2056194379) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2056194379, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2056194379} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2056194379, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2056194379, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-2056194379|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 17:04:22,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1167716265 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1167716265 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1167716265 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1167716265 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1167716265| ~z$r_buff1_thd4~0_In1167716265)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite14_Out1167716265| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1167716265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1167716265, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1167716265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167716265} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1167716265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1167716265, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1167716265|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1167716265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167716265} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 17:04:22,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 17:04:22,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:04:22,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite20_Out-265917242| |ULTIMATE.start_main_#t~ite19_Out-265917242|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-265917242 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-265917242 256)))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-265917242 |ULTIMATE.start_main_#t~ite19_Out-265917242|) (not .cse2)) (and (= ~z~0_In-265917242 |ULTIMATE.start_main_#t~ite19_Out-265917242|) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-265917242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-265917242, ~z$w_buff1~0=~z$w_buff1~0_In-265917242, ~z~0=~z~0_In-265917242} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-265917242|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-265917242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-265917242, ~z$w_buff1~0=~z$w_buff1~0_In-265917242, ~z~0=~z~0_In-265917242, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-265917242|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:04:22,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1839122569 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1839122569 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1839122569| ~z$w_buff0_used~0_In1839122569) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1839122569| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1839122569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1839122569} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1839122569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1839122569, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1839122569|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:04:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2142325399 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2142325399 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2142325399 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2142325399 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2142325399 |ULTIMATE.start_main_#t~ite22_Out2142325399|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out2142325399|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2142325399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2142325399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2142325399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142325399} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2142325399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2142325399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2142325399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142325399, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2142325399|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:04:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-430780353 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-430780353 256)))) (or (and (= ~z$r_buff0_thd0~0_In-430780353 |ULTIMATE.start_main_#t~ite23_Out-430780353|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-430780353| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-430780353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-430780353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-430780353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-430780353, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-430780353|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:04:22,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1044466083 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1044466083 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1044466083 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1044466083 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1044466083|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-1044466083 |ULTIMATE.start_main_#t~ite24_Out-1044466083|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044466083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044466083, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1044466083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044466083} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044466083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044466083, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1044466083, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1044466083|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044466083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:04:22,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-633034885 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-633034885| ~z$w_buff0_used~0_In-633034885) (= |ULTIMATE.start_main_#t~ite36_In-633034885| |ULTIMATE.start_main_#t~ite36_Out-633034885|)) (and (= |ULTIMATE.start_main_#t~ite37_Out-633034885| |ULTIMATE.start_main_#t~ite36_Out-633034885|) .cse0 (= ~z$w_buff0_used~0_In-633034885 |ULTIMATE.start_main_#t~ite36_Out-633034885|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-633034885 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-633034885 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-633034885 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-633034885 256)))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-633034885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-633034885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-633034885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-633034885, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-633034885|, ~weak$$choice2~0=~weak$$choice2~0_In-633034885} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-633034885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-633034885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-633034885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-633034885, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-633034885|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-633034885|, ~weak$$choice2~0=~weak$$choice2~0_In-633034885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:04:22,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2135666761 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_In2135666761| |ULTIMATE.start_main_#t~ite39_Out2135666761|) (not .cse0) (= ~z$w_buff1_used~0_In2135666761 |ULTIMATE.start_main_#t~ite40_Out2135666761|)) (and (= |ULTIMATE.start_main_#t~ite39_Out2135666761| |ULTIMATE.start_main_#t~ite40_Out2135666761|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2135666761 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In2135666761 256)) .cse1) (= (mod ~z$w_buff0_used~0_In2135666761 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In2135666761 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out2135666761| ~z$w_buff1_used~0_In2135666761)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135666761, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135666761, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In2135666761|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135666761, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135666761, ~weak$$choice2~0=~weak$$choice2~0_In2135666761} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135666761, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2135666761|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2135666761|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135666761, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135666761, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135666761, ~weak$$choice2~0=~weak$$choice2~0_In2135666761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:04:22,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:04:22,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:04:22,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:04:22,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:22 BasicIcfg [2019-12-27 17:04:22,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:04:22,160 INFO L168 Benchmark]: Toolchain (without parser) took 29084.92 ms. Allocated memory was 145.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 102.1 MB in the beginning and 895.1 MB in the end (delta: -793.0 MB). Peak memory consumption was 470.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,161 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.20 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,163 INFO L168 Benchmark]: Boogie Preprocessor took 42.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,163 INFO L168 Benchmark]: RCFGBuilder took 779.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 101.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,164 INFO L168 Benchmark]: TraceAbstraction took 27374.20 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 101.1 MB in the beginning and 895.1 MB in the end (delta: -794.0 MB). Peak memory consumption was 411.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:22,168 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.20 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 101.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27374.20 ms. Allocated memory was 203.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 101.1 MB in the beginning and 895.1 MB in the end (delta: -794.0 MB). Peak memory consumption was 411.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1677 SDtfs, 3069 SDslu, 4353 SDs, 0 SdLazy, 1908 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 43 SyntacticMatches, 15 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36697occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 5929 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 140606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...