/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:34,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:34,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:34,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:34,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:34,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:34,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:34,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:34,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:34,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:34,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:34,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:34,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:34,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:34,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:34,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:34,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:34,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:34,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:34,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:34,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:34,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:34,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:34,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:34,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:34,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:34,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:34,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:34,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:34,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:34,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:34,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:34,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:34,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:34,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:34,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:34,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:34,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:34,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:34,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:34,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:34,787 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-VariableLbe.epf [2019-12-18 23:03:34,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:34,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:34,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:34,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:34,809 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:34,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:34,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:34,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:34,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:34,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:34,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:34,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:34,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:34,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:34,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:34,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:34,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:34,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:34,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:34,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:34,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:34,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:34,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:34,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:34,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:35,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:35,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:35,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:35,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:35,104 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:35,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2019-12-18 23:03:35,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517e6c17a/aa90fedb3d1b4f6285d98aa7f6af6e25/FLAGd795c1b77 [2019-12-18 23:03:35,678 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:35,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2019-12-18 23:03:35,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517e6c17a/aa90fedb3d1b4f6285d98aa7f6af6e25/FLAGd795c1b77 [2019-12-18 23:03:36,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517e6c17a/aa90fedb3d1b4f6285d98aa7f6af6e25 [2019-12-18 23:03:36,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:36,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:36,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:36,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:36,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:36,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36, skipping insertion in model container [2019-12-18 23:03:36,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:36,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:36,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:36,662 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:36,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:36,805 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:36,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36 WrapperNode [2019-12-18 23:03:36,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:36,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:36,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:36,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:36,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:36,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:36,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:36,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:36,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... [2019-12-18 23:03:36,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:36,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:36,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:36,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:36,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:36,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:36,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:36,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:36,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:36,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:36,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:36,982 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:03:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:03:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:36,985 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:37,762 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:37,763 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:37,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:37 BoogieIcfgContainer [2019-12-18 23:03:37,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:37,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:37,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:37,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:37,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:36" (1/3) ... [2019-12-18 23:03:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19551d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:37, skipping insertion in model container [2019-12-18 23:03:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:36" (2/3) ... [2019-12-18 23:03:37,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19551d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:37, skipping insertion in model container [2019-12-18 23:03:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:37" (3/3) ... [2019-12-18 23:03:37,776 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.oepc.i [2019-12-18 23:03:37,787 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:37,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:37,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:37,794 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:37,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:37,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:03:37,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:37,944 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:37,944 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:37,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:37,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:37,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:37,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:37,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:37,967 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 23:03:37,969 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 23:03:38,057 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 23:03:38,057 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:38,075 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 23:03:38,103 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 23:03:38,150 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 23:03:38,150 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:38,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 23:03:38,179 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 23:03:38,181 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:41,031 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 23:03:41,348 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 23:03:41,467 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 23:03:41,502 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93606 [2019-12-18 23:03:41,503 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-18 23:03:41,506 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-18 23:04:01,044 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126872 states. [2019-12-18 23:04:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 126872 states. [2019-12-18 23:04:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:04:01,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:01,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:04:01,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 835743, now seen corresponding path program 1 times [2019-12-18 23:04:01,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:01,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487455947] [2019-12-18 23:04:01,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:01,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487455947] [2019-12-18 23:04:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:04:01,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708421316] [2019-12-18 23:04:01,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:01,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:01,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:01,342 INFO L87 Difference]: Start difference. First operand 126872 states. Second operand 3 states. [2019-12-18 23:04:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:04,510 INFO L93 Difference]: Finished difference Result 126172 states and 544995 transitions. [2019-12-18 23:04:04,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:04,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:04:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:05,423 INFO L225 Difference]: With dead ends: 126172 [2019-12-18 23:04:05,424 INFO L226 Difference]: Without dead ends: 123624 [2019-12-18 23:04:05,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123624 states. [2019-12-18 23:04:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123624 to 123624. [2019-12-18 23:04:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123624 states. [2019-12-18 23:04:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123624 states to 123624 states and 534607 transitions. [2019-12-18 23:04:18,453 INFO L78 Accepts]: Start accepts. Automaton has 123624 states and 534607 transitions. Word has length 3 [2019-12-18 23:04:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:18,454 INFO L462 AbstractCegarLoop]: Abstraction has 123624 states and 534607 transitions. [2019-12-18 23:04:18,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 123624 states and 534607 transitions. [2019-12-18 23:04:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:04:18,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:18,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:18,459 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 358672898, now seen corresponding path program 1 times [2019-12-18 23:04:18,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:18,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973008184] [2019-12-18 23:04:18,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:18,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973008184] [2019-12-18 23:04:18,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:18,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:18,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906784419] [2019-12-18 23:04:18,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:18,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:18,612 INFO L87 Difference]: Start difference. First operand 123624 states and 534607 transitions. Second operand 4 states. [2019-12-18 23:04:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:24,124 INFO L93 Difference]: Finished difference Result 192934 states and 798071 transitions. [2019-12-18 23:04:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:24,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:04:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:24,820 INFO L225 Difference]: With dead ends: 192934 [2019-12-18 23:04:24,820 INFO L226 Difference]: Without dead ends: 192885 [2019-12-18 23:04:24,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192885 states. [2019-12-18 23:04:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192885 to 177949. [2019-12-18 23:04:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177949 states. [2019-12-18 23:04:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177949 states to 177949 states and 745039 transitions. [2019-12-18 23:04:35,163 INFO L78 Accepts]: Start accepts. Automaton has 177949 states and 745039 transitions. Word has length 11 [2019-12-18 23:04:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:35,163 INFO L462 AbstractCegarLoop]: Abstraction has 177949 states and 745039 transitions. [2019-12-18 23:04:35,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 177949 states and 745039 transitions. [2019-12-18 23:04:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:35,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:35,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:35,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -432185852, now seen corresponding path program 1 times [2019-12-18 23:04:35,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:35,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138867218] [2019-12-18 23:04:35,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:35,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138867218] [2019-12-18 23:04:35,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:35,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:35,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313995588] [2019-12-18 23:04:35,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:35,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:35,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:35,226 INFO L87 Difference]: Start difference. First operand 177949 states and 745039 transitions. Second operand 3 states. [2019-12-18 23:04:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:35,361 INFO L93 Difference]: Finished difference Result 35462 states and 116599 transitions. [2019-12-18 23:04:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:35,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:04:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:35,425 INFO L225 Difference]: With dead ends: 35462 [2019-12-18 23:04:35,425 INFO L226 Difference]: Without dead ends: 35462 [2019-12-18 23:04:35,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2019-12-18 23:04:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 35462. [2019-12-18 23:04:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35462 states. [2019-12-18 23:04:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35462 states to 35462 states and 116599 transitions. [2019-12-18 23:04:41,534 INFO L78 Accepts]: Start accepts. Automaton has 35462 states and 116599 transitions. Word has length 13 [2019-12-18 23:04:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:41,534 INFO L462 AbstractCegarLoop]: Abstraction has 35462 states and 116599 transitions. [2019-12-18 23:04:41,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 35462 states and 116599 transitions. [2019-12-18 23:04:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:41,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:41,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:41,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -796950478, now seen corresponding path program 1 times [2019-12-18 23:04:41,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:41,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039558073] [2019-12-18 23:04:41,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:41,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039558073] [2019-12-18 23:04:41,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:41,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:41,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558327272] [2019-12-18 23:04:41,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:41,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:41,638 INFO L87 Difference]: Start difference. First operand 35462 states and 116599 transitions. Second operand 4 states. [2019-12-18 23:04:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:42,107 INFO L93 Difference]: Finished difference Result 47114 states and 151311 transitions. [2019-12-18 23:04:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:42,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:04:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:42,238 INFO L225 Difference]: With dead ends: 47114 [2019-12-18 23:04:42,238 INFO L226 Difference]: Without dead ends: 47107 [2019-12-18 23:04:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47107 states. [2019-12-18 23:04:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47107 to 41593. [2019-12-18 23:04:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41593 states. [2019-12-18 23:04:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41593 states to 41593 states and 135840 transitions. [2019-12-18 23:04:43,337 INFO L78 Accepts]: Start accepts. Automaton has 41593 states and 135840 transitions. Word has length 13 [2019-12-18 23:04:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:43,338 INFO L462 AbstractCegarLoop]: Abstraction has 41593 states and 135840 transitions. [2019-12-18 23:04:43,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41593 states and 135840 transitions. [2019-12-18 23:04:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:04:43,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:43,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:43,342 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:43,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1918798733, now seen corresponding path program 1 times [2019-12-18 23:04:43,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:43,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272173549] [2019-12-18 23:04:43,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:43,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-18 23:04:43,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272173549] [2019-12-18 23:04:43,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:43,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:43,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96208804] [2019-12-18 23:04:43,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:43,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:43,431 INFO L87 Difference]: Start difference. First operand 41593 states and 135840 transitions. Second operand 5 states. [2019-12-18 23:04:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:44,241 INFO L93 Difference]: Finished difference Result 55558 states and 177410 transitions. [2019-12-18 23:04:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:04:44,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 23:04:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:44,332 INFO L225 Difference]: With dead ends: 55558 [2019-12-18 23:04:44,332 INFO L226 Difference]: Without dead ends: 55545 [2019-12-18 23:04:44,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:04:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55545 states. [2019-12-18 23:04:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55545 to 41907. [2019-12-18 23:04:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41907 states. [2019-12-18 23:04:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41907 states to 41907 states and 136705 transitions. [2019-12-18 23:04:45,615 INFO L78 Accepts]: Start accepts. Automaton has 41907 states and 136705 transitions. Word has length 19 [2019-12-18 23:04:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:45,615 INFO L462 AbstractCegarLoop]: Abstraction has 41907 states and 136705 transitions. [2019-12-18 23:04:45,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 41907 states and 136705 transitions. [2019-12-18 23:04:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:04:45,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:45,629 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] [2019-12-18 23:04:45,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1840473137, now seen corresponding path program 1 times [2019-12-18 23:04:45,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:45,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009418770] [2019-12-18 23:04:45,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:45,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009418770] [2019-12-18 23:04:45,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:45,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:45,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040268006] [2019-12-18 23:04:45,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:45,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:45,701 INFO L87 Difference]: Start difference. First operand 41907 states and 136705 transitions. Second operand 4 states. [2019-12-18 23:04:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:45,748 INFO L93 Difference]: Finished difference Result 7558 states and 20694 transitions. [2019-12-18 23:04:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:04:45,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 23:04:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:45,764 INFO L225 Difference]: With dead ends: 7558 [2019-12-18 23:04:45,764 INFO L226 Difference]: Without dead ends: 7558 [2019-12-18 23:04:45,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-18 23:04:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7446. [2019-12-18 23:04:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7446 states. [2019-12-18 23:04:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 20374 transitions. [2019-12-18 23:04:45,865 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 20374 transitions. Word has length 25 [2019-12-18 23:04:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:45,865 INFO L462 AbstractCegarLoop]: Abstraction has 7446 states and 20374 transitions. [2019-12-18 23:04:45,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 20374 transitions. [2019-12-18 23:04:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 23:04:45,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:45,877 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] [2019-12-18 23:04:45,877 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1306882487, now seen corresponding path program 1 times [2019-12-18 23:04:45,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:45,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651477182] [2019-12-18 23:04:45,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:45,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651477182] [2019-12-18 23:04:45,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:45,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:45,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967675055] [2019-12-18 23:04:45,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:45,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:45,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:45,992 INFO L87 Difference]: Start difference. First operand 7446 states and 20374 transitions. Second operand 5 states. [2019-12-18 23:04:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:46,035 INFO L93 Difference]: Finished difference Result 5313 states and 15270 transitions. [2019-12-18 23:04:46,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:46,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 23:04:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:46,046 INFO L225 Difference]: With dead ends: 5313 [2019-12-18 23:04:46,046 INFO L226 Difference]: Without dead ends: 5313 [2019-12-18 23:04:46,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-18 23:04:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4949. [2019-12-18 23:04:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-18 23:04:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14286 transitions. [2019-12-18 23:04:46,122 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14286 transitions. Word has length 37 [2019-12-18 23:04:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:46,123 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14286 transitions. [2019-12-18 23:04:46,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14286 transitions. [2019-12-18 23:04:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:04:46,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:46,132 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, 1, 1, 1, 1, 1] [2019-12-18 23:04:46,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1856109427, now seen corresponding path program 1 times [2019-12-18 23:04:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301245702] [2019-12-18 23:04:46,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301245702] [2019-12-18 23:04:46,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:46,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:46,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130593097] [2019-12-18 23:04:46,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:46,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:46,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:46,203 INFO L87 Difference]: Start difference. First operand 4949 states and 14286 transitions. Second operand 3 states. [2019-12-18 23:04:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:46,263 INFO L93 Difference]: Finished difference Result 4958 states and 14300 transitions. [2019-12-18 23:04:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:46,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 23:04:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:46,272 INFO L225 Difference]: With dead ends: 4958 [2019-12-18 23:04:46,272 INFO L226 Difference]: Without dead ends: 4958 [2019-12-18 23:04:46,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-18 23:04:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-18 23:04:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-18 23:04:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14296 transitions. [2019-12-18 23:04:46,338 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14296 transitions. Word has length 65 [2019-12-18 23:04:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:46,339 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14296 transitions. [2019-12-18 23:04:46,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14296 transitions. [2019-12-18 23:04:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:04:46,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:46,347 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, 1, 1, 1, 1, 1] [2019-12-18 23:04:46,347 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -907011133, now seen corresponding path program 1 times [2019-12-18 23:04:46,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:46,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801399372] [2019-12-18 23:04:46,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:46,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801399372] [2019-12-18 23:04:46,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:46,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:46,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056434376] [2019-12-18 23:04:46,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:46,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:46,454 INFO L87 Difference]: Start difference. First operand 4954 states and 14296 transitions. Second operand 3 states. [2019-12-18 23:04:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:46,487 INFO L93 Difference]: Finished difference Result 4666 states and 13247 transitions. [2019-12-18 23:04:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:46,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 23:04:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:46,496 INFO L225 Difference]: With dead ends: 4666 [2019-12-18 23:04:46,496 INFO L226 Difference]: Without dead ends: 4666 [2019-12-18 23:04:46,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-18 23:04:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-18 23:04:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 23:04:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13247 transitions. [2019-12-18 23:04:46,608 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13247 transitions. Word has length 65 [2019-12-18 23:04:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13247 transitions. [2019-12-18 23:04:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13247 transitions. [2019-12-18 23:04:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:46,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:46,617 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, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:46,617 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1452404307, now seen corresponding path program 1 times [2019-12-18 23:04:46,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:46,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912296631] [2019-12-18 23:04:46,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:46,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912296631] [2019-12-18 23:04:46,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:46,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:46,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44479527] [2019-12-18 23:04:46,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:46,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:46,725 INFO L87 Difference]: Start difference. First operand 4666 states and 13247 transitions. Second operand 5 states. [2019-12-18 23:04:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:47,035 INFO L93 Difference]: Finished difference Result 6996 states and 19623 transitions. [2019-12-18 23:04:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:04:47,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 23:04:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:47,046 INFO L225 Difference]: With dead ends: 6996 [2019-12-18 23:04:47,046 INFO L226 Difference]: Without dead ends: 6996 [2019-12-18 23:04:47,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-12-18 23:04:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 4950. [2019-12-18 23:04:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 23:04:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14092 transitions. [2019-12-18 23:04:47,130 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14092 transitions. Word has length 66 [2019-12-18 23:04:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:47,130 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14092 transitions. [2019-12-18 23:04:47,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14092 transitions. [2019-12-18 23:04:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:47,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:47,137 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, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:47,137 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1528718795, now seen corresponding path program 2 times [2019-12-18 23:04:47,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:47,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628485225] [2019-12-18 23:04:47,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:47,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628485225] [2019-12-18 23:04:47,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:47,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:47,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895438030] [2019-12-18 23:04:47,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:47,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:47,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:47,242 INFO L87 Difference]: Start difference. First operand 4950 states and 14092 transitions. Second operand 5 states. [2019-12-18 23:04:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:47,557 INFO L93 Difference]: Finished difference Result 7482 states and 21136 transitions. [2019-12-18 23:04:47,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:04:47,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 23:04:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:47,568 INFO L225 Difference]: With dead ends: 7482 [2019-12-18 23:04:47,568 INFO L226 Difference]: Without dead ends: 7482 [2019-12-18 23:04:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2019-12-18 23:04:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6173. [2019-12-18 23:04:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-18 23:04:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17593 transitions. [2019-12-18 23:04:47,709 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17593 transitions. Word has length 66 [2019-12-18 23:04:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:47,709 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17593 transitions. [2019-12-18 23:04:47,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17593 transitions. [2019-12-18 23:04:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:47,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:47,718 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, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:47,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 899715013, now seen corresponding path program 3 times [2019-12-18 23:04:47,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562878404] [2019-12-18 23:04:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:47,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562878404] [2019-12-18 23:04:47,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:47,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:47,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080237939] [2019-12-18 23:04:47,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:47,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:47,791 INFO L87 Difference]: Start difference. First operand 6173 states and 17593 transitions. Second operand 3 states. [2019-12-18 23:04:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:47,820 INFO L93 Difference]: Finished difference Result 5524 states and 15482 transitions. [2019-12-18 23:04:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:47,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 23:04:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:47,829 INFO L225 Difference]: With dead ends: 5524 [2019-12-18 23:04:47,829 INFO L226 Difference]: Without dead ends: 5524 [2019-12-18 23:04:47,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2019-12-18 23:04:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5176. [2019-12-18 23:04:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5176 states. [2019-12-18 23:04:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 14532 transitions. [2019-12-18 23:04:47,913 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 14532 transitions. Word has length 66 [2019-12-18 23:04:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:47,913 INFO L462 AbstractCegarLoop]: Abstraction has 5176 states and 14532 transitions. [2019-12-18 23:04:47,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 14532 transitions. [2019-12-18 23:04:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 23:04:47,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:47,921 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:47,921 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1280277573, now seen corresponding path program 1 times [2019-12-18 23:04:47,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:47,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568783823] [2019-12-18 23:04:47,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:48,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568783823] [2019-12-18 23:04:48,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:48,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:04:48,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153705082] [2019-12-18 23:04:48,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:04:48,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:04:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:48,043 INFO L87 Difference]: Start difference. First operand 5176 states and 14532 transitions. Second operand 7 states. [2019-12-18 23:04:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:49,183 INFO L93 Difference]: Finished difference Result 7563 states and 21033 transitions. [2019-12-18 23:04:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 23:04:49,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 23:04:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:49,194 INFO L225 Difference]: With dead ends: 7563 [2019-12-18 23:04:49,194 INFO L226 Difference]: Without dead ends: 7563 [2019-12-18 23:04:49,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:04:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2019-12-18 23:04:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 5619. [2019-12-18 23:04:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2019-12-18 23:04:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 15770 transitions. [2019-12-18 23:04:49,282 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 15770 transitions. Word has length 67 [2019-12-18 23:04:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:49,282 INFO L462 AbstractCegarLoop]: Abstraction has 5619 states and 15770 transitions. [2019-12-18 23:04:49,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:04:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 15770 transitions. [2019-12-18 23:04:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 23:04:49,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:49,290 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:49,290 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:49,290 INFO L82 PathProgramCache]: Analyzing trace with hash -229560523, now seen corresponding path program 2 times [2019-12-18 23:04:49,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:49,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974431388] [2019-12-18 23:04:49,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:49,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974431388] [2019-12-18 23:04:49,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:49,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:49,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007830205] [2019-12-18 23:04:49,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:49,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:49,366 INFO L87 Difference]: Start difference. First operand 5619 states and 15770 transitions. Second operand 3 states. [2019-12-18 23:04:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:49,426 INFO L93 Difference]: Finished difference Result 5619 states and 15769 transitions. [2019-12-18 23:04:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:49,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 23:04:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:49,436 INFO L225 Difference]: With dead ends: 5619 [2019-12-18 23:04:49,436 INFO L226 Difference]: Without dead ends: 5619 [2019-12-18 23:04:49,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2019-12-18 23:04:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 2989. [2019-12-18 23:04:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-18 23:04:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8465 transitions. [2019-12-18 23:04:49,524 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8465 transitions. Word has length 67 [2019-12-18 23:04:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:49,524 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8465 transitions. [2019-12-18 23:04:49,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8465 transitions. [2019-12-18 23:04:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:49,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:49,531 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:49,531 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -283246847, now seen corresponding path program 1 times [2019-12-18 23:04:49,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:49,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142898236] [2019-12-18 23:04:49,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:49,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142898236] [2019-12-18 23:04:49,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:49,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:04:49,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409628586] [2019-12-18 23:04:49,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:04:49,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:04:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:04:49,893 INFO L87 Difference]: Start difference. First operand 2989 states and 8465 transitions. Second operand 14 states. [2019-12-18 23:04:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:51,349 INFO L93 Difference]: Finished difference Result 8218 states and 23059 transitions. [2019-12-18 23:04:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:04:51,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 23:04:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:51,361 INFO L225 Difference]: With dead ends: 8218 [2019-12-18 23:04:51,361 INFO L226 Difference]: Without dead ends: 8186 [2019-12-18 23:04:51,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 23:04:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2019-12-18 23:04:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 4307. [2019-12-18 23:04:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2019-12-18 23:04:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 12101 transitions. [2019-12-18 23:04:51,436 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 12101 transitions. Word has length 68 [2019-12-18 23:04:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:51,437 INFO L462 AbstractCegarLoop]: Abstraction has 4307 states and 12101 transitions. [2019-12-18 23:04:51,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:04:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 12101 transitions. [2019-12-18 23:04:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:51,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:51,442 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:51,442 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -107188779, now seen corresponding path program 2 times [2019-12-18 23:04:51,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:51,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191213482] [2019-12-18 23:04:51,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:51,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191213482] [2019-12-18 23:04:51,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:51,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:04:51,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518472287] [2019-12-18 23:04:51,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:04:51,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:51,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:04:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:04:51,675 INFO L87 Difference]: Start difference. First operand 4307 states and 12101 transitions. Second operand 13 states. [2019-12-18 23:04:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:52,262 INFO L93 Difference]: Finished difference Result 7074 states and 19863 transitions. [2019-12-18 23:04:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:04:52,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 23:04:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:52,272 INFO L225 Difference]: With dead ends: 7074 [2019-12-18 23:04:52,272 INFO L226 Difference]: Without dead ends: 7042 [2019-12-18 23:04:52,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:04:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7042 states. [2019-12-18 23:04:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7042 to 4144. [2019-12-18 23:04:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-18 23:04:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11628 transitions. [2019-12-18 23:04:52,344 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11628 transitions. Word has length 68 [2019-12-18 23:04:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:52,344 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11628 transitions. [2019-12-18 23:04:52,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:04:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11628 transitions. [2019-12-18 23:04:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:52,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:52,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:52,350 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -812333303, now seen corresponding path program 3 times [2019-12-18 23:04:52,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:52,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532562102] [2019-12-18 23:04:52,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:52,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:04:52,462 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:04:52,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~z$w_buff0~0_31) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2501~0.base_22|) (= v_~z$w_buff0_used~0_119 0) (= 0 v_~weak$$choice0~0_9) (= v_~main$tmp_guard0~0_7 0) (= v_~z$r_buff0_thd3~0_20 0) (= |v_ULTIMATE.start_main_~#t2501~0.offset_17| 0) (= 0 v_~z$r_buff1_thd2~0_17) (= v_~x~0_13 0) (= v_~z$read_delayed~0_8 0) (= v_~z$read_delayed_var~0.base_8 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2501~0.base_22| 4)) (= 0 v_~weak$$choice2~0_34) (= 0 v_~z$flush_delayed~0_16) (= 0 v_~z$r_buff1_thd1~0_20) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$w_buff1_used~0_73) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2501~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2501~0.base_22|) |v_ULTIMATE.start_main_~#t2501~0.offset_17| 0))) (< 0 |v_#StackHeapBarrier_14|) (= v_~z$r_buff0_thd1~0_27 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2501~0.base_22| 1) |v_#valid_54|) (= v_~main$tmp_guard1~0_14 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$mem_tmp~0_12 0) (= v_~z~0_30 0) (= 0 v_~z$w_buff1~0_27) (= v_~y~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2501~0.base_22|)) (= v_~z$r_buff0_thd2~0_21 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start_main_~#t2502~0.offset=|v_ULTIMATE.start_main_~#t2502~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, #length=|v_#length_21|, ULTIMATE.start_main_~#t2501~0.base=|v_ULTIMATE.start_main_~#t2501~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ULTIMATE.start_main_~#t2503~0.base=|v_ULTIMATE.start_main_~#t2503~0.base_19|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t2502~0.base=|v_ULTIMATE.start_main_~#t2502~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_~#t2503~0.offset=|v_ULTIMATE.start_main_~#t2503~0.offset_14|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t2501~0.offset=|v_ULTIMATE.start_main_~#t2501~0.offset_17|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_119, ~z$w_buff0~0=v_~z$w_buff0~0_31, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, 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_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2502~0.offset, ~z$r_buff0_thd0~0, #length, ULTIMATE.start_main_~#t2501~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2503~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2502~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2503~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2501~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:04:52,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_83 v_~z$w_buff1_used~0_48) (= 2 v_~z$w_buff0~0_17) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~z$w_buff1_used~0_48 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_82 1) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_15) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_83, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_48, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~z$w_buff1~0=v_~z$w_buff1~0_15, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 23:04:52,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1405627768 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1405627768 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1405627768|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1405627768 |P0Thread1of1ForFork0_#t~ite5_Out1405627768|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1405627768, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1405627768} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1405627768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1405627768, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1405627768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 23:04:52,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2502~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2502~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2502~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2502~0.base_9|) |v_ULTIMATE.start_main_~#t2502~0.offset_9| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2502~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t2502~0.offset_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2502~0.base_9| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2502~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2502~0.offset=|v_ULTIMATE.start_main_~#t2502~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t2502~0.base=|v_ULTIMATE.start_main_~#t2502~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2502~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2502~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 23:04:52,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1039000838 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1039000838 256)))) (or (and (= ~z$w_buff1~0_In1039000838 |P1Thread1of1ForFork1_#t~ite9_Out1039000838|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1039000838 |P1Thread1of1ForFork1_#t~ite9_Out1039000838|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1039000838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1039000838, ~z$w_buff1~0=~z$w_buff1~0_In1039000838, ~z~0=~z~0_In1039000838} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1039000838|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1039000838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1039000838, ~z$w_buff1~0=~z$w_buff1~0_In1039000838, ~z~0=~z~0_In1039000838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:04:52,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-1-->L807: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2503~0.base_13|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2503~0.base_13| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2503~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2503~0.base_13|) |v_ULTIMATE.start_main_~#t2503~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2503~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2503~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2503~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2503~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2503~0.base=|v_ULTIMATE.start_main_~#t2503~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2503~0.offset=|v_ULTIMATE.start_main_~#t2503~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2503~0.base, #length, ULTIMATE.start_main_~#t2503~0.offset] because there is no mapped edge [2019-12-18 23:04:52,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 23:04:52,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In2092895266 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2092895266 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2092895266| ~z$w_buff0_used~0_In2092895266)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out2092895266|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2092895266, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2092895266} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2092895266, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2092895266|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2092895266} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 23:04:52,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-401116478 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-401116478 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-401116478| ~z~0_In-401116478)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-401116478| ~z$w_buff1~0_In-401116478) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-401116478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401116478, ~z$w_buff1~0=~z$w_buff1~0_In-401116478, ~z~0=~z~0_In-401116478} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-401116478|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-401116478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401116478, ~z$w_buff1~0=~z$w_buff1~0_In-401116478, ~z~0=~z~0_In-401116478} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 23:04:52,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 23:04:52,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-915737318 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-915737318 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-915737318|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-915737318| ~z$w_buff0_used~0_In-915737318) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-915737318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-915737318} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-915737318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-915737318, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-915737318|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 23:04:52,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1805104010 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1805104010 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1805104010 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1805104010 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1805104010 |P2Thread1of1ForFork2_#t~ite18_Out-1805104010|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1805104010| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805104010, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1805104010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1805104010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1805104010} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805104010, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1805104010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1805104010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1805104010, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1805104010|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 23:04:52,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-2019659408 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-2019659408 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2019659408 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2019659408 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-2019659408| ~z$w_buff1_used~0_In-2019659408) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out-2019659408| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019659408, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2019659408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2019659408, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2019659408} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019659408, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2019659408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2019659408, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2019659408|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2019659408} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 23:04:52,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1843629320 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1843629320 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-1843629320| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1843629320 |P2Thread1of1ForFork2_#t~ite19_Out-1843629320|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1843629320, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1843629320} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1843629320, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1843629320, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1843629320|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 23:04:52,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-111970782 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-111970782 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-111970782|)) (and (= ~z$r_buff0_thd2~0_In-111970782 |P1Thread1of1ForFork1_#t~ite13_Out-111970782|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-111970782, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-111970782} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-111970782, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-111970782|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-111970782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 23:04:52,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-900487166 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-900487166 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-900487166 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-900487166 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-900487166| ~z$r_buff1_thd2~0_In-900487166) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-900487166| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-900487166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-900487166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-900487166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-900487166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-900487166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-900487166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-900487166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-900487166|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-900487166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:04:52,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 23:04:52,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In174277612 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In174277612 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In174277612 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In174277612 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out174277612| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In174277612 |P2Thread1of1ForFork2_#t~ite20_Out174277612|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In174277612, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In174277612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In174277612, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In174277612} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In174277612, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out174277612|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In174277612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In174277612, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In174277612} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 23:04:52,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 23:04:52,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In966247670 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In966247670 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In966247670 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In966247670 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out966247670| ~z$w_buff1_used~0_In966247670)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out966247670|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In966247670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In966247670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In966247670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In966247670} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out966247670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966247670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In966247670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In966247670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In966247670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 23:04:52,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-572212505 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-572212505 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-572212505 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-572212505 ~z$r_buff0_thd1~0_In-572212505)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-572212505, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-572212505} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-572212505, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-572212505|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-572212505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:04:52,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In2107303201 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In2107303201 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2107303201 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In2107303201 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In2107303201 |P0Thread1of1ForFork0_#t~ite8_Out2107303201|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2107303201|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2107303201, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2107303201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2107303201, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2107303201} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2107303201, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2107303201|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2107303201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2107303201, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2107303201} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 23:04:52,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 23:04:52,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:04:52,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-572810898 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-572810898 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite24_Out-572810898| |ULTIMATE.start_main_#t~ite25_Out-572810898|))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out-572810898| ~z~0_In-572810898)) (and (not .cse1) (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite24_Out-572810898| ~z$w_buff1~0_In-572810898)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-572810898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572810898, ~z$w_buff1~0=~z$w_buff1~0_In-572810898, ~z~0=~z~0_In-572810898} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-572810898, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-572810898|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572810898, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-572810898|, ~z$w_buff1~0=~z$w_buff1~0_In-572810898, ~z~0=~z~0_In-572810898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 23:04:52,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-870748724 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-870748724 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-870748724| ~z$w_buff0_used~0_In-870748724) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-870748724| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870748724, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870748724} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870748724, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870748724, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-870748724|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 23:04:52,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In672710521 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In672710521 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In672710521 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In672710521 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out672710521| ~z$w_buff1_used~0_In672710521) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out672710521|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In672710521, ~z$w_buff0_used~0=~z$w_buff0_used~0_In672710521, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In672710521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In672710521} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In672710521, ~z$w_buff0_used~0=~z$w_buff0_used~0_In672710521, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In672710521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In672710521, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out672710521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 23:04:52,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1229657636 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1229657636 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1229657636| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1229657636| ~z$r_buff0_thd0~0_In1229657636) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1229657636, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1229657636} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1229657636, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1229657636|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1229657636} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 23:04:52,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1041618309 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1041618309 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1041618309 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1041618309 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-1041618309| ~z$r_buff1_thd0~0_In-1041618309) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1041618309| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1041618309, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1041618309, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1041618309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1041618309} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1041618309, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1041618309|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1041618309, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1041618309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1041618309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 23:04:52,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~z$r_buff0_thd0~0_73 v_~z$r_buff0_thd0~0_72)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_72, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 23:04:52,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L832-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:04:52,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:04:52,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:04:52 BasicIcfg [2019-12-18 23:04:52,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:04:52,581 INFO L168 Benchmark]: Toolchain (without parser) took 76554.98 ms. Allocated memory was 136.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,582 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.85 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 154.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 151.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,584 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,585 INFO L168 Benchmark]: RCFGBuilder took 845.69 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,586 INFO L168 Benchmark]: TraceAbstraction took 74812.45 ms. Allocated memory was 200.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 23:04:52,592 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.85 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 154.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 151.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.21 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.69 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74812.45 ms. Allocated memory was 200.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 173 ProgramPointsBefore, 97 ProgramPointsAfterwards, 210 TransitionsBefore, 110 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5431 VarBasedMoverChecksPositive, 176 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 93606 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L805] FCALL, FORK 0 pthread_create(&t2502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L760] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] FCALL, FORK 0 pthread_create(&t2503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L780] 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 [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 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 [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L813] 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) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 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 [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 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 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L824] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L824] 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) [L825] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L825] 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)) [L826] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L826] 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)) [L827] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L827] 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)) [L828] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L828] 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)) [L830] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L830] 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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2501 SDtfs, 2243 SDslu, 5846 SDs, 0 SdLazy, 3545 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177949occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 49622 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 137980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...