/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/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:52:04,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:52:04,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:52:04,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:52:04,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:52:04,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:52:04,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:52:04,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:52:04,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:52:04,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:52:04,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:52:04,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:52:04,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:52:04,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:52:04,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:52:04,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:52:04,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:52:04,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:52:04,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:52:04,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:52:04,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:52:04,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:52:04,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:52:04,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:52:04,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:52:04,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:52:04,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:52:04,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:52:04,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:52:04,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:52:04,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:52:04,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:52:04,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:52:04,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:52:04,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:52:04,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:52:04,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:52:04,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:52:04,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:52:04,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:52:04,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:52:04,853 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-27 05:52:04,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:52:04,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:52:04,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:52:04,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:52:04,872 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:52:04,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:52:04,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:52:04,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:52:04,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:52:04,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:52:04,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:52:04,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:52:04,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:52:04,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:52:04,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:52:04,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:52:04,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:52:04,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:52:04,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:52:04,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:52:04,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:52:04,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:52:04,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:52:04,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:52:04,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:52:05,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:52:05,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:52:05,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:52:05,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:52:05,226 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:52:05,227 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 05:52:05,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff870768f/a95c16a487ff4124a7d8e34396bffa60/FLAG8d6a11d47 [2019-12-27 05:52:05,919 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:52:05,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 05:52:05,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff870768f/a95c16a487ff4124a7d8e34396bffa60/FLAG8d6a11d47 [2019-12-27 05:52:06,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff870768f/a95c16a487ff4124a7d8e34396bffa60 [2019-12-27 05:52:06,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:52:06,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:52:06,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:52:06,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:52:06,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:52:06,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:06,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113399e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06, skipping insertion in model container [2019-12-27 05:52:06,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:06,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:52:06,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:52:06,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:52:06,804 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:52:06,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:52:06,944 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:52:06,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06 WrapperNode [2019-12-27 05:52:06,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:52:06,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:52:06,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:52:06,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:52:06,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:06,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:52:07,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:52:07,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:52:07,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:52:07,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... [2019-12-27 05:52:07,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:52:07,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:52:07,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:52:07,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:52:07,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:52:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:52:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:52:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:52:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:52:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:52:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:52:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:52:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:52:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:52:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:52:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:52:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:52:07,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:52:07,139 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:52:07,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:52:07,891 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:52:07,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:52:07 BoogieIcfgContainer [2019-12-27 05:52:07,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:52:07,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:52:07,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:52:07,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:52:07,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:52:06" (1/3) ... [2019-12-27 05:52:07,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ece1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:52:07, skipping insertion in model container [2019-12-27 05:52:07,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:52:06" (2/3) ... [2019-12-27 05:52:07,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ece1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:52:07, skipping insertion in model container [2019-12-27 05:52:07,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:52:07" (3/3) ... [2019-12-27 05:52:07,901 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-27 05:52:07,910 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:52:07,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:52:07,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:52:07,918 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:52:07,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:07,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,024 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,025 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:52:08,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:52:08,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:52:08,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:52:08,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:52:08,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:52:08,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:52:08,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:52:08,069 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:52:08,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:52:08,093 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 05:52:08,095 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:52:08,213 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:52:08,213 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:52:08,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:52:08,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:52:08,336 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:52:08,336 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:52:08,344 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:52:08,363 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 05:52:08,364 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:52:12,190 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 05:52:12,339 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 05:52:12,372 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 05:52:12,374 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 05:52:12,378 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 05:52:22,228 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 05:52:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 05:52:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:52:22,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:22,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:52:22,237 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 05:52:22,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:22,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087645691] [2019-12-27 05:52:22,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:22,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087645691] [2019-12-27 05:52:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:22,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:52:22,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700733153] [2019-12-27 05:52:22,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:22,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:22,499 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 05:52:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:24,996 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 05:52:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:24,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:52:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:25,560 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 05:52:25,564 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 05:52:25,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 05:52:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 05:52:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 05:52:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 05:52:34,925 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 05:52:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:34,925 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 05:52:34,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 05:52:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:52:34,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:34,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:34,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 05:52:34,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:34,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546914280] [2019-12-27 05:52:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:35,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546914280] [2019-12-27 05:52:35,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:35,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:35,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042925244] [2019-12-27 05:52:35,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:35,020 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 05:52:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:35,235 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 05:52:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:35,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:52:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:35,340 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 05:52:35,341 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 05:52:35,342 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-27 05:52:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 05:52:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 05:52:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 05:52:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 05:52:35,874 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 05:52:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:35,875 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 05:52:35,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 05:52:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:52:35,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:35,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:35,877 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 05:52:35,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:35,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879031142] [2019-12-27 05:52:35,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:36,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879031142] [2019-12-27 05:52:36,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:36,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:36,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446470600] [2019-12-27 05:52:36,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:36,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:36,021 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 05:52:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:36,971 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 05:52:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:36,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:52:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:37,128 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 05:52:37,128 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 05:52:37,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 05:52:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 05:52:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 05:52:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 05:52:37,888 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 05:52:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:37,888 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 05:52:37,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 05:52:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:52:37,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:37,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:37,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 05:52:37,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:37,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755718219] [2019-12-27 05:52:37,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:37,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755718219] [2019-12-27 05:52:37,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:37,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:37,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199136038] [2019-12-27 05:52:37,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:37,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:37,978 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-27 05:52:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:38,348 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 05:52:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:38,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:52:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:38,433 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 05:52:38,433 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 05:52:38,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 05:52:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 05:52:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 05:52:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 05:52:39,678 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 05:52:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:39,679 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 05:52:39,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 05:52:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:52:39,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:39,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:39,681 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 05:52:39,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:39,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738790013] [2019-12-27 05:52:39,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:39,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738790013] [2019-12-27 05:52:39,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:39,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:39,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757409630] [2019-12-27 05:52:39,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:39,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:39,798 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-27 05:52:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:40,083 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 05:52:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:40,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:52:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:40,146 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 05:52:40,146 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 05:52:40,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 05:52:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 05:52:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 05:52:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 05:52:41,361 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 05:52:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:41,362 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 05:52:41,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 05:52:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:52:41,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:41,372 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] [2019-12-27 05:52:41,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 05:52:41,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:41,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465598030] [2019-12-27 05:52:41,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:41,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465598030] [2019-12-27 05:52:41,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:41,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:41,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048986573] [2019-12-27 05:52:41,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:41,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:41,498 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 05:52:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:42,089 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 05:52:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:52:42,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:52:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:42,167 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 05:52:42,167 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 05:52:42,168 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-27 05:52:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 05:52:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 05:52:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 05:52:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 05:52:42,855 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 05:52:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:42,855 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 05:52:42,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 05:52:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:52:42,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:42,865 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] [2019-12-27 05:52:42,865 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 05:52:42,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:42,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252485207] [2019-12-27 05:52:42,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:42,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252485207] [2019-12-27 05:52:42,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:42,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:42,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803832370] [2019-12-27 05:52:42,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:42,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:42,949 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 05:52:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:44,970 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 05:52:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:52:44,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:52:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:45,048 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 05:52:45,048 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 05:52:45,048 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-27 05:52:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 05:52:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 05:52:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 05:52:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 05:52:45,690 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 05:52:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 05:52:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 05:52:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:52:45,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:45,706 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-27 05:52:45,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 05:52:45,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:45,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574065364] [2019-12-27 05:52:45,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:45,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574065364] [2019-12-27 05:52:45,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:45,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:45,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765041583] [2019-12-27 05:52:45,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:45,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:45,760 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 05:52:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:45,824 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 05:52:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:52:45,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:52:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:45,842 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 05:52:45,842 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 05:52:45,842 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-27 05:52:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 05:52:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 05:52:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 05:52:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 05:52:46,001 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 05:52:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:46,002 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 05:52:46,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 05:52:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:52:46,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:46,016 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] [2019-12-27 05:52:46,016 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 05:52:46,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:46,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152545988] [2019-12-27 05:52:46,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:46,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152545988] [2019-12-27 05:52:46,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:46,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:52:46,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972511021] [2019-12-27 05:52:46,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:46,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:46,080 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 05:52:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:46,122 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 05:52:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:46,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:52:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:46,142 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 05:52:46,143 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 05:52:46,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 05:52:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 05:52:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 05:52:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 05:52:46,461 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 05:52:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:46,462 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 05:52:46,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 05:52:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:52:46,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:46,478 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] [2019-12-27 05:52:46,478 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 05:52:46,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:46,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396926526] [2019-12-27 05:52:46,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:46,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396926526] [2019-12-27 05:52:46,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:46,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:52:46,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907306398] [2019-12-27 05:52:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:46,545 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 05:52:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:46,611 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-27 05:52:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:46,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:52:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:46,630 INFO L225 Difference]: With dead ends: 10239 [2019-12-27 05:52:46,630 INFO L226 Difference]: Without dead ends: 10239 [2019-12-27 05:52:46,630 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-27 05:52:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-27 05:52:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-27 05:52:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-27 05:52:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-27 05:52:46,781 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-27 05:52:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-27 05:52:46,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-27 05:52:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:46,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:46,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:46,796 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 05:52:46,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:46,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589774243] [2019-12-27 05:52:46,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:46,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589774243] [2019-12-27 05:52:46,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:46,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:46,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943475024] [2019-12-27 05:52:46,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:46,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:46,846 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-27 05:52:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:46,924 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-27 05:52:46,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:46,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:52:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:46,952 INFO L225 Difference]: With dead ends: 12683 [2019-12-27 05:52:46,953 INFO L226 Difference]: Without dead ends: 12683 [2019-12-27 05:52:46,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-27 05:52:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-27 05:52:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 05:52:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 05:52:47,209 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-27 05:52:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:47,209 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 05:52:47,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 05:52:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:47,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:47,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:47,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 05:52:47,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503418313] [2019-12-27 05:52:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:47,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503418313] [2019-12-27 05:52:47,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:47,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:52:47,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307522107] [2019-12-27 05:52:47,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:52:47,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:47,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:52:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:52:47,356 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 7 states. [2019-12-27 05:52:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:47,770 INFO L93 Difference]: Finished difference Result 26623 states and 83594 transitions. [2019-12-27 05:52:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:47,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:52:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:47,804 INFO L225 Difference]: With dead ends: 26623 [2019-12-27 05:52:47,805 INFO L226 Difference]: Without dead ends: 20927 [2019-12-27 05:52:47,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:52:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20927 states. [2019-12-27 05:52:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20927 to 13189. [2019-12-27 05:52:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-27 05:52:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-27 05:52:48,083 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-27 05:52:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:48,083 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-27 05:52:48,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:52:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-27 05:52:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:48,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:48,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:48,104 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 05:52:48,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:48,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090046674] [2019-12-27 05:52:48,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090046674] [2019-12-27 05:52:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:52:48,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760940431] [2019-12-27 05:52:48,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:52:48,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:52:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:52:48,207 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-27 05:52:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:48,798 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-27 05:52:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:48,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:52:48,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:48,837 INFO L225 Difference]: With dead ends: 34316 [2019-12-27 05:52:48,838 INFO L226 Difference]: Without dead ends: 25449 [2019-12-27 05:52:48,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:52:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-27 05:52:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-27 05:52:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-27 05:52:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-27 05:52:49,190 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-27 05:52:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:49,190 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-27 05:52:49,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:52:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-27 05:52:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:49,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:49,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:49,212 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-27 05:52:49,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:49,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079212857] [2019-12-27 05:52:49,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:49,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079212857] [2019-12-27 05:52:49,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:49,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:49,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398472834] [2019-12-27 05:52:49,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:49,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:49,348 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-27 05:52:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:51,057 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-27 05:52:51,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 05:52:51,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:52:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:51,186 INFO L225 Difference]: With dead ends: 89167 [2019-12-27 05:52:51,186 INFO L226 Difference]: Without dead ends: 76971 [2019-12-27 05:52:51,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 05:52:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-27 05:52:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-27 05:52:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-27 05:52:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-27 05:52:52,343 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-27 05:52:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:52,343 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-27 05:52:52,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-27 05:52:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:52,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:52,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:52,379 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-27 05:52:52,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:52,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441834269] [2019-12-27 05:52:52,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441834269] [2019-12-27 05:52:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151062061] [2019-12-27 05:52:52,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:52,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:52,482 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 9 states. [2019-12-27 05:52:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:54,054 INFO L93 Difference]: Finished difference Result 69362 states and 216514 transitions. [2019-12-27 05:52:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:52:54,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:52:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:54,157 INFO L225 Difference]: With dead ends: 69362 [2019-12-27 05:52:54,157 INFO L226 Difference]: Without dead ends: 66294 [2019-12-27 05:52:54,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 05:52:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66294 states. [2019-12-27 05:52:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66294 to 22741. [2019-12-27 05:52:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-27 05:52:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-27 05:52:55,141 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-27 05:52:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:55,141 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-27 05:52:55,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-27 05:52:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:55,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:55,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:55,174 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 05:52:55,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:55,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347547682] [2019-12-27 05:52:55,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:55,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347547682] [2019-12-27 05:52:55,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:55,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:55,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42732823] [2019-12-27 05:52:55,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:55,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:55,239 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 3 states. [2019-12-27 05:52:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:55,345 INFO L93 Difference]: Finished difference Result 22739 states and 73033 transitions. [2019-12-27 05:52:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:55,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:52:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:55,389 INFO L225 Difference]: With dead ends: 22739 [2019-12-27 05:52:55,390 INFO L226 Difference]: Without dead ends: 22739 [2019-12-27 05:52:55,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22739 states. [2019-12-27 05:52:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22739 to 21096. [2019-12-27 05:52:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21096 states. [2019-12-27 05:52:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 68535 transitions. [2019-12-27 05:52:55,742 INFO L78 Accepts]: Start accepts. Automaton has 21096 states and 68535 transitions. Word has length 54 [2019-12-27 05:52:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:55,743 INFO L462 AbstractCegarLoop]: Abstraction has 21096 states and 68535 transitions. [2019-12-27 05:52:55,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21096 states and 68535 transitions. [2019-12-27 05:52:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 05:52:55,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:55,765 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] [2019-12-27 05:52:55,766 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 05:52:55,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:55,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968053057] [2019-12-27 05:52:55,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:55,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968053057] [2019-12-27 05:52:55,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:55,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:55,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705734774] [2019-12-27 05:52:55,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:55,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:55,845 INFO L87 Difference]: Start difference. First operand 21096 states and 68535 transitions. Second operand 3 states. [2019-12-27 05:52:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:55,942 INFO L93 Difference]: Finished difference Result 19398 states and 61782 transitions. [2019-12-27 05:52:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:55,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 05:52:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:55,983 INFO L225 Difference]: With dead ends: 19398 [2019-12-27 05:52:55,984 INFO L226 Difference]: Without dead ends: 19398 [2019-12-27 05:52:55,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2019-12-27 05:52:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 16534. [2019-12-27 05:52:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16534 states. [2019-12-27 05:52:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 52346 transitions. [2019-12-27 05:52:56,333 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 52346 transitions. Word has length 55 [2019-12-27 05:52:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:56,333 INFO L462 AbstractCegarLoop]: Abstraction has 16534 states and 52346 transitions. [2019-12-27 05:52:56,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 52346 transitions. [2019-12-27 05:52:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:56,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:56,350 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] [2019-12-27 05:52:56,351 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 05:52:56,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:56,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55217478] [2019-12-27 05:52:56,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55217478] [2019-12-27 05:52:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:56,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404452432] [2019-12-27 05:52:56,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:56,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:56,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:56,477 INFO L87 Difference]: Start difference. First operand 16534 states and 52346 transitions. Second operand 9 states. [2019-12-27 05:52:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:57,914 INFO L93 Difference]: Finished difference Result 29391 states and 92467 transitions. [2019-12-27 05:52:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:52:57,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 05:52:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:57,950 INFO L225 Difference]: With dead ends: 29391 [2019-12-27 05:52:57,950 INFO L226 Difference]: Without dead ends: 24775 [2019-12-27 05:52:57,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:52:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24775 states. [2019-12-27 05:52:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24775 to 17142. [2019-12-27 05:52:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17142 states. [2019-12-27 05:52:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 54026 transitions. [2019-12-27 05:52:58,256 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 54026 transitions. Word has length 56 [2019-12-27 05:52:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:58,256 INFO L462 AbstractCegarLoop]: Abstraction has 17142 states and 54026 transitions. [2019-12-27 05:52:58,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 54026 transitions. [2019-12-27 05:52:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:58,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:58,274 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] [2019-12-27 05:52:58,274 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 05:52:58,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:58,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593930844] [2019-12-27 05:52:58,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:58,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593930844] [2019-12-27 05:52:58,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:58,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:52:58,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012250613] [2019-12-27 05:52:58,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:52:58,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:52:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:52:58,426 INFO L87 Difference]: Start difference. First operand 17142 states and 54026 transitions. Second operand 11 states. [2019-12-27 05:52:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:59,541 INFO L93 Difference]: Finished difference Result 31855 states and 99158 transitions. [2019-12-27 05:52:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:52:59,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 05:52:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:59,582 INFO L225 Difference]: With dead ends: 31855 [2019-12-27 05:52:59,582 INFO L226 Difference]: Without dead ends: 25991 [2019-12-27 05:52:59,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 05:52:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25991 states. [2019-12-27 05:52:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25991 to 15962. [2019-12-27 05:52:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15962 states. [2019-12-27 05:52:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15962 states to 15962 states and 49980 transitions. [2019-12-27 05:52:59,901 INFO L78 Accepts]: Start accepts. Automaton has 15962 states and 49980 transitions. Word has length 56 [2019-12-27 05:52:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:59,901 INFO L462 AbstractCegarLoop]: Abstraction has 15962 states and 49980 transitions. [2019-12-27 05:52:59,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:52:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 49980 transitions. [2019-12-27 05:52:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:59,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:59,918 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] [2019-12-27 05:52:59,918 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 3 times [2019-12-27 05:52:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551801996] [2019-12-27 05:52:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:52:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:53:00,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:53:00,018 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:53:00,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= |v_ULTIMATE.start_main_~#t648~0.offset_13| 0) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_16| 4)) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) |v_ULTIMATE.start_main_~#t648~0.offset_13| 0)) |v_#memory_int_17|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16|)) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16| 1)) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_13|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_15|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:53:00,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:53:00,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= ~y$w_buff0~0_Out-1577426392 1) (= |P1Thread1of1ForFork1_#in~arg.base_In-1577426392| P1Thread1of1ForFork1_~arg.base_Out-1577426392) (= ~y$w_buff1_used~0_Out-1577426392 ~y$w_buff0_used~0_In-1577426392) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1577426392 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1577426392|) (= ~y$w_buff1~0_Out-1577426392 ~y$w_buff0~0_In-1577426392) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1577426392|) (= P1Thread1of1ForFork1_~arg.offset_Out-1577426392 |P1Thread1of1ForFork1_#in~arg.offset_In-1577426392|) (= (mod ~y$w_buff1_used~0_Out-1577426392 256) 0) (= 1 ~y$w_buff0_used~0_Out-1577426392)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577426392, ~y$w_buff0~0=~y$w_buff0~0_In-1577426392, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1577426392|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1577426392|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1577426392, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1577426392, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1577426392, ~y$w_buff1~0=~y$w_buff1~0_Out-1577426392, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1577426392|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1577426392, ~y$w_buff0~0=~y$w_buff0~0_Out-1577426392, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1577426392|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1577426392|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1577426392} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:53:00,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:53:00,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out-273900862| |P2Thread1of1ForFork2_#t~ite33_Out-273900862|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-273900862 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-273900862 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-273900862 |P2Thread1of1ForFork2_#t~ite32_Out-273900862|)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In-273900862 |P2Thread1of1ForFork2_#t~ite32_Out-273900862|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-273900862, ~y$w_buff1~0=~y$w_buff1~0_In-273900862, ~y~0=~y~0_In-273900862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273900862} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-273900862, ~y$w_buff1~0=~y$w_buff1~0_In-273900862, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-273900862|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-273900862|, ~y~0=~y~0_In-273900862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273900862} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 05:53:00,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1924945093 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1924945093 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1924945093|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1924945093 |P1Thread1of1ForFork1_#t~ite28_Out1924945093|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1924945093, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1924945093} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1924945093, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1924945093, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1924945093|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:53:00,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2065903080 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2065903080 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out-2065903080| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-2065903080| ~y$w_buff0_used~0_In-2065903080)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2065903080, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2065903080} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-2065903080|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2065903080, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2065903080} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 05:53:00,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-2108602721 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2108602721 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2108602721 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2108602721 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2108602721 |P2Thread1of1ForFork2_#t~ite35_Out-2108602721|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out-2108602721|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2108602721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108602721, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2108602721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2108602721} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-2108602721|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2108602721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108602721, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2108602721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2108602721} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 05:53:00,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-2027666862 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2027666862 256)))) (or (and (= ~y$r_buff0_thd3~0_In-2027666862 |P2Thread1of1ForFork2_#t~ite36_Out-2027666862|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-2027666862|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027666862, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2027666862} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-2027666862|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027666862, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2027666862} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 05:53:00,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1718228378 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1718228378 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1718228378 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1718228378 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite37_Out1718228378| ~y$r_buff1_thd3~0_In1718228378) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out1718228378|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1718228378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1718228378, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1718228378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1718228378} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out1718228378|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1718228378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1718228378, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1718228378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1718228378} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 05:53:00,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 05:53:00,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1772637084 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1772637084 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1772637084 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1772637084 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1772637084|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1772637084| ~y$w_buff1_used~0_In1772637084) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1772637084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1772637084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1772637084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1772637084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1772637084, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1772637084|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1772637084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1772637084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1772637084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 05:53:00,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In552043541 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In552043541 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out552043541 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out552043541 ~y$r_buff0_thd2~0_In552043541) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In552043541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In552043541} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out552043541|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In552043541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out552043541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:53:00,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In723974721 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In723974721 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In723974721 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In723974721 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out723974721|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out723974721| ~y$r_buff1_thd2~0_In723974721)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In723974721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723974721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In723974721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723974721} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In723974721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723974721, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out723974721|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In723974721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723974721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 05:53:00,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 05:53:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2073672367 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_In2073672367| |P0Thread1of1ForFork0_#t~ite8_Out2073672367|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out2073672367| ~y$w_buff0~0_In2073672367)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out2073672367| |P0Thread1of1ForFork0_#t~ite8_Out2073672367|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2073672367 256)))) (or (= (mod ~y$w_buff0_used~0_In2073672367 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In2073672367 256)) .cse1) (and (= (mod ~y$r_buff1_thd1~0_In2073672367 256) 0) .cse1))) .cse0 (= ~y$w_buff0~0_In2073672367 |P0Thread1of1ForFork0_#t~ite8_Out2073672367|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073672367, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073672367, ~y$w_buff0~0=~y$w_buff0~0_In2073672367, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073672367, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In2073672367|, ~weak$$choice2~0=~weak$$choice2~0_In2073672367, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073672367} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073672367, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out2073672367|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073672367, ~y$w_buff0~0=~y$w_buff0~0_In2073672367, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2073672367|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073672367, ~weak$$choice2~0=~weak$$choice2~0_In2073672367, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073672367} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:53:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-419259435 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out-419259435| |P0Thread1of1ForFork0_#t~ite12_Out-419259435|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-419259435 256)))) (or (= (mod ~y$w_buff0_used~0_In-419259435 256) 0) (and (= (mod ~y$w_buff1_used~0_In-419259435 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-419259435 256))))) (= |P0Thread1of1ForFork0_#t~ite11_Out-419259435| ~y$w_buff1~0_In-419259435) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite12_Out-419259435| ~y$w_buff1~0_In-419259435) (= |P0Thread1of1ForFork0_#t~ite11_In-419259435| |P0Thread1of1ForFork0_#t~ite11_Out-419259435|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-419259435|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-419259435, ~y$w_buff1~0=~y$w_buff1~0_In-419259435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419259435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-419259435, ~weak$$choice2~0=~weak$$choice2~0_In-419259435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419259435} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-419259435|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-419259435, ~y$w_buff1~0=~y$w_buff1~0_In-419259435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419259435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-419259435, ~weak$$choice2~0=~weak$$choice2~0_In-419259435, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-419259435|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419259435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 05:53:00,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 05:53:00,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1561252612 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1561252612 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd1~0_In1561252612 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1561252612 256) 0)) (.cse5 (= |P0Thread1of1ForFork0_#t~ite24_Out1561252612| |P0Thread1of1ForFork0_#t~ite23_Out1561252612|)) (.cse4 (= (mod ~weak$$choice2~0_In1561252612 256) 0))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite22_Out1561252612| 0) (or (not .cse1) .cse2) (= |P0Thread1of1ForFork0_#t~ite22_Out1561252612| |P0Thread1of1ForFork0_#t~ite23_Out1561252612|) (or (not .cse3) .cse2) .cse4 .cse5)) (and (or (and (or .cse0 (and .cse3 .cse6) (and .cse6 .cse1)) (= ~y$r_buff1_thd1~0_In1561252612 |P0Thread1of1ForFork0_#t~ite23_Out1561252612|) .cse4 .cse5) (and (= |P0Thread1of1ForFork0_#t~ite24_Out1561252612| ~y$r_buff1_thd1~0_In1561252612) (= |P0Thread1of1ForFork0_#t~ite23_In1561252612| |P0Thread1of1ForFork0_#t~ite23_Out1561252612|) (not .cse4))) (= |P0Thread1of1ForFork0_#t~ite22_In1561252612| |P0Thread1of1ForFork0_#t~ite22_Out1561252612|)))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In1561252612|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1561252612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1561252612, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1561252612, ~weak$$choice2~0=~weak$$choice2~0_In1561252612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1561252612, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1561252612|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out1561252612|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1561252612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1561252612, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1561252612, ~weak$$choice2~0=~weak$$choice2~0_In1561252612, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1561252612|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1561252612|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1561252612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 05:53:00,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 05:53:00,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:53:00,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2053701135 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2053701135 256)))) (or (and (= ~y~0_In-2053701135 |ULTIMATE.start_main_#t~ite41_Out-2053701135|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-2053701135 |ULTIMATE.start_main_#t~ite41_Out-2053701135|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2053701135, ~y~0=~y~0_In-2053701135, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2053701135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2053701135} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2053701135|, ~y$w_buff1~0=~y$w_buff1~0_In-2053701135, ~y~0=~y~0_In-2053701135, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2053701135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2053701135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 05:53:00,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:53:00,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In613195728 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In613195728 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out613195728|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out613195728| ~y$w_buff0_used~0_In613195728)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In613195728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In613195728} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In613195728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In613195728, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out613195728|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:53:00,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In943298137 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In943298137 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In943298137 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In943298137 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out943298137| ~y$w_buff1_used~0_In943298137) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out943298137|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In943298137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In943298137, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In943298137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943298137} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In943298137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In943298137, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In943298137, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out943298137|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943298137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:53:00,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1911761693 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1911761693 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1911761693|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1911761693| ~y$r_buff0_thd0~0_In1911761693) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1911761693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1911761693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1911761693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1911761693, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1911761693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:53:00,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1042129942 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1042129942 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1042129942 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1042129942 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1042129942| ~y$r_buff1_thd0~0_In-1042129942) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1042129942|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1042129942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1042129942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1042129942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1042129942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1042129942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1042129942, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1042129942|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1042129942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1042129942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 05:53:00,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:53:00,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:53:00 BasicIcfg [2019-12-27 05:53:00,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:53:00,148 INFO L168 Benchmark]: Toolchain (without parser) took 53998.04 ms. Allocated memory was 144.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 99.5 MB in the beginning and 809.5 MB in the end (delta: -710.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,150 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.41 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 99.1 MB in the beginning and 153.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 200.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,154 INFO L168 Benchmark]: Boogie Preprocessor took 53.35 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,155 INFO L168 Benchmark]: RCFGBuilder took 829.26 ms. Allocated memory is still 200.3 MB. Free memory was 148.1 MB in the beginning and 100.3 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,158 INFO L168 Benchmark]: TraceAbstraction took 52252.83 ms. Allocated memory was 200.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.3 MB in the beginning and 809.5 MB in the end (delta: -709.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 05:53:00,164 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.48 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.41 ms. Allocated memory was 144.2 MB in the beginning and 200.3 MB in the end (delta: 56.1 MB). Free memory was 99.1 MB in the beginning and 153.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 200.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.35 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.26 ms. Allocated memory is still 200.3 MB. Free memory was 148.1 MB in the beginning and 100.3 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52252.83 ms. Allocated memory was 200.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.3 MB in the beginning and 809.5 MB in the end (delta: -709.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 5304 SDslu, 11983 SDs, 0 SdLazy, 4851 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 182310 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 754 NumberOfCodeBlocks, 754 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 679 ConstructedInterpolants, 0 QuantifiedInterpolants, 95309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...