/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:21:53,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:21:53,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:21:53,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:21:53,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:21:53,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:21:53,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:21:53,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:21:53,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:21:53,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:21:53,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:21:53,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:21:53,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:21:53,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:21:53,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:21:53,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:21:53,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:21:53,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:21:53,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:21:53,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:21:53,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:21:53,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:21:53,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:21:53,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:21:53,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:21:53,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:21:53,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:21:53,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:21:53,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:21:53,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:21:53,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:21:53,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:21:53,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:21:53,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:21:53,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:21:53,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:21:53,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:21:53,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:21:53,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:21:53,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:21:53,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:21:53,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:21:53,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:21:53,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:21:53,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:21:53,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:21:53,899 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:21:53,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:21:53,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:21:53,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:21:53,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:21:53,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:21:53,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:21:53,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:21:53,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:21:53,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:21:53,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:21:53,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:21:53,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:21:53,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:21:53,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:21:53,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:21:53,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:21:53,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:21:53,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:21:53,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:21:53,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:21:54,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:21:54,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:21:54,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:21:54,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:21:54,201 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:21:54,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-26 22:21:54,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d946f56fb/c4910f4c9b83418384cb384b42bab676/FLAG7a6e252ad [2019-12-26 22:21:54,826 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:21:54,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-26 22:21:54,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d946f56fb/c4910f4c9b83418384cb384b42bab676/FLAG7a6e252ad [2019-12-26 22:21:55,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d946f56fb/c4910f4c9b83418384cb384b42bab676 [2019-12-26 22:21:55,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:21:55,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:21:55,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:21:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:21:55,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:21:55,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:55,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55, skipping insertion in model container [2019-12-26 22:21:55,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:55,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:21:55,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:21:55,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:21:55,755 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:21:55,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:21:55,933 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:21:55,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55 WrapperNode [2019-12-26 22:21:55,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:21:55,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:21:55,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:21:55,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:21:55,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:55,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:55,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:21:55,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:21:55,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:21:55,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:21:56,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (1/1) ... [2019-12-26 22:21:56,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:21:56,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:21:56,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:21:56,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:21:56,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (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-26 22:21:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:21:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:21:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:21:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:21:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:21:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:21:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:21:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:21:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:21:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:21:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:21:56,107 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:21:56,811 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:21:56,811 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:21:56,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:21:56 BoogieIcfgContainer [2019-12-26 22:21:56,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:21:56,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:21:56,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:21:56,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:21:56,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:21:55" (1/3) ... [2019-12-26 22:21:56,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807e31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:21:56, skipping insertion in model container [2019-12-26 22:21:56,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:21:55" (2/3) ... [2019-12-26 22:21:56,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807e31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:21:56, skipping insertion in model container [2019-12-26 22:21:56,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:21:56" (3/3) ... [2019-12-26 22:21:56,830 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-12-26 22:21:56,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:21:56,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:21:56,851 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:21:56,852 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:21:56,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,908 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,909 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:21:56,986 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:21:57,003 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:21:57,004 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:21:57,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:21:57,004 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:21:57,004 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:21:57,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:21:57,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:21:57,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:21:57,022 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-26 22:21:57,024 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-26 22:21:57,114 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-26 22:21:57,115 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:21:57,128 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:21:57,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-26 22:21:57,192 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-26 22:21:57,193 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:21:57,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:21:57,213 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:21:57,215 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:22:01,938 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 22:22:02,066 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 22:22:02,328 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-26 22:22:02,328 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 22:22:02,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-26 22:22:02,785 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-26 22:22:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-26 22:22:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:22:02,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:02,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:22:02,796 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-26 22:22:02,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:02,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708084263] [2019-12-26 22:22:02,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:03,024 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-26 22:22:03,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708084263] [2019-12-26 22:22:03,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:03,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:22:03,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427150731] [2019-12-26 22:22:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:03,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:03,059 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-26 22:22:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:03,370 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-26 22:22:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:03,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:22:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:03,490 INFO L225 Difference]: With dead ends: 8598 [2019-12-26 22:22:03,490 INFO L226 Difference]: Without dead ends: 7662 [2019-12-26 22:22:03,491 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-26 22:22:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-26 22:22:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-26 22:22:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-26 22:22:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-26 22:22:03,872 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-26 22:22:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:03,873 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-26 22:22:03,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-26 22:22:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:22:03,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:03,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:03,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-26 22:22:03,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:03,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133029201] [2019-12-26 22:22:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:03,984 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-26 22:22:03,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133029201] [2019-12-26 22:22:03,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:03,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:03,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659123749] [2019-12-26 22:22:03,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:03,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:03,988 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-26 22:22:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:04,025 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-26 22:22:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:04,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 22:22:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:04,033 INFO L225 Difference]: With dead ends: 1232 [2019-12-26 22:22:04,033 INFO L226 Difference]: Without dead ends: 1232 [2019-12-26 22:22:04,035 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-26 22:22:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-26 22:22:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-26 22:22:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-26 22:22:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-26 22:22:04,073 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-26 22:22:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:04,074 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-26 22:22:04,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-26 22:22:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:22:04,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:04,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:04,081 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-26 22:22:04,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:04,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52434174] [2019-12-26 22:22:04,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:04,185 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-26 22:22:04,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52434174] [2019-12-26 22:22:04,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:04,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:04,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609247621] [2019-12-26 22:22:04,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:04,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:04,187 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-26 22:22:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:04,238 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-26 22:22:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:04,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 22:22:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:04,250 INFO L225 Difference]: With dead ends: 1943 [2019-12-26 22:22:04,250 INFO L226 Difference]: Without dead ends: 1943 [2019-12-26 22:22:04,251 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-26 22:22:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-26 22:22:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-26 22:22:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-26 22:22:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-26 22:22:04,294 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-26 22:22:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:04,294 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-26 22:22:04,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-26 22:22:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:22:04,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:04,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:04,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-26 22:22:04,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:04,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192441893] [2019-12-26 22:22:04,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:04,365 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-26 22:22:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192441893] [2019-12-26 22:22:04,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:04,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168428050] [2019-12-26 22:22:04,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:22:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:22:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:04,368 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-26 22:22:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:04,586 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-26 22:22:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:22:04,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:22:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:04,597 INFO L225 Difference]: With dead ends: 1724 [2019-12-26 22:22:04,598 INFO L226 Difference]: Without dead ends: 1724 [2019-12-26 22:22:04,598 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-26 22:22:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-26 22:22:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-26 22:22:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-26 22:22:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-26 22:22:04,646 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-26 22:22:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:04,646 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-26 22:22:04,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:22:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-26 22:22:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:22:04,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:04,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:04,648 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:04,649 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-26 22:22:04,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535836808] [2019-12-26 22:22:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:04,733 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-26 22:22:04,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535836808] [2019-12-26 22:22:04,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:04,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:04,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110074402] [2019-12-26 22:22:04,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:22:04,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:22:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:04,736 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-26 22:22:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:04,929 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-26 22:22:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:22:04,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:22:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:04,941 INFO L225 Difference]: With dead ends: 1991 [2019-12-26 22:22:04,942 INFO L226 Difference]: Without dead ends: 1991 [2019-12-26 22:22:04,942 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-26 22:22:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-26 22:22:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-26 22:22:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-26 22:22:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-26 22:22:04,989 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-26 22:22:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:04,990 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-26 22:22:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:22:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-26 22:22:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:22:04,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:04,992 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] [2019-12-26 22:22:04,993 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-26 22:22:04,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:04,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174615513] [2019-12-26 22:22:04,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:05,106 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-26 22:22:05,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174615513] [2019-12-26 22:22:05,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:05,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:05,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520744565] [2019-12-26 22:22:05,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:05,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:05,108 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-26 22:22:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:05,380 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-26 22:22:05,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:22:05,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:22:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:05,393 INFO L225 Difference]: With dead ends: 2258 [2019-12-26 22:22:05,393 INFO L226 Difference]: Without dead ends: 2258 [2019-12-26 22:22:05,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:22:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-26 22:22:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-26 22:22:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-26 22:22:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-26 22:22:05,441 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-26 22:22:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:05,441 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-26 22:22:05,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-26 22:22:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:22:05,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:05,445 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] [2019-12-26 22:22:05,445 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-26 22:22:05,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:05,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410740621] [2019-12-26 22:22:05,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:05,492 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-26 22:22:05,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410740621] [2019-12-26 22:22:05,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:05,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:22:05,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9280306] [2019-12-26 22:22:05,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:05,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:05,494 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-26 22:22:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:05,507 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-26 22:22:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:05,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 22:22:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:05,517 INFO L225 Difference]: With dead ends: 2001 [2019-12-26 22:22:05,517 INFO L226 Difference]: Without dead ends: 2001 [2019-12-26 22:22:05,517 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-26 22:22:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-26 22:22:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-26 22:22:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-26 22:22:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-26 22:22:05,562 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-26 22:22:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:05,562 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-26 22:22:05,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-26 22:22:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:22:05,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:05,565 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] [2019-12-26 22:22:05,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:05,566 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-26 22:22:05,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:05,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420529974] [2019-12-26 22:22:05,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:05,661 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-26 22:22:05,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420529974] [2019-12-26 22:22:05,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:05,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:05,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850660550] [2019-12-26 22:22:05,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:05,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:05,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:05,664 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-26 22:22:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:05,912 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-26 22:22:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:22:05,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:22:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:05,925 INFO L225 Difference]: With dead ends: 2378 [2019-12-26 22:22:05,925 INFO L226 Difference]: Without dead ends: 2378 [2019-12-26 22:22:05,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:22:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-26 22:22:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-26 22:22:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-26 22:22:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-26 22:22:06,018 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-26 22:22:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:06,019 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-26 22:22:06,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-26 22:22:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:22:06,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:06,022 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] [2019-12-26 22:22:06,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-26 22:22:06,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:06,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021033267] [2019-12-26 22:22:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:06,126 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-26 22:22:06,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021033267] [2019-12-26 22:22:06,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:06,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:22:06,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993727781] [2019-12-26 22:22:06,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:06,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:06,129 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 5 states. [2019-12-26 22:22:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:06,612 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-26 22:22:06,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:22:06,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:22:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:06,620 INFO L225 Difference]: With dead ends: 2697 [2019-12-26 22:22:06,621 INFO L226 Difference]: Without dead ends: 2697 [2019-12-26 22:22:06,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:22:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-26 22:22:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-26 22:22:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-26 22:22:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-26 22:22:06,674 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-26 22:22:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:06,674 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-26 22:22:06,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-26 22:22:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:22:06,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:06,678 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] [2019-12-26 22:22:06,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-26 22:22:06,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:06,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450165391] [2019-12-26 22:22:06,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:06,717 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-26 22:22:06,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450165391] [2019-12-26 22:22:06,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:06,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:06,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036926322] [2019-12-26 22:22:06,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:22:06,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:06,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:22:06,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:06,719 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 4 states. [2019-12-26 22:22:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:06,747 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-26 22:22:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:22:06,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 22:22:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:06,752 INFO L225 Difference]: With dead ends: 1330 [2019-12-26 22:22:06,752 INFO L226 Difference]: Without dead ends: 1330 [2019-12-26 22:22:06,752 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-26 22:22:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-26 22:22:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-26 22:22:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-26 22:22:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-26 22:22:06,778 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-26 22:22:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:06,778 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-26 22:22:06,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:22:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-26 22:22:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 22:22:06,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:06,782 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] [2019-12-26 22:22:06,782 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:06,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-26 22:22:06,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:06,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091159259] [2019-12-26 22:22:06,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:06,867 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-26 22:22:06,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091159259] [2019-12-26 22:22:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:22:06,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494843400] [2019-12-26 22:22:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:22:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:22:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:22:06,870 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 7 states. [2019-12-26 22:22:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:07,177 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-26 22:22:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:22:07,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 22:22:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:07,183 INFO L225 Difference]: With dead ends: 3273 [2019-12-26 22:22:07,183 INFO L226 Difference]: Without dead ends: 2143 [2019-12-26 22:22:07,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:22:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-26 22:22:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-26 22:22:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-26 22:22:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-26 22:22:07,217 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-26 22:22:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:07,218 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-26 22:22:07,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:22:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-26 22:22:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 22:22:07,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:07,221 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] [2019-12-26 22:22:07,222 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-26 22:22:07,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:07,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247143509] [2019-12-26 22:22:07,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:07,301 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-26 22:22:07,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247143509] [2019-12-26 22:22:07,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:07,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:07,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528028543] [2019-12-26 22:22:07,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:07,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:07,304 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-26 22:22:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:07,355 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-26 22:22:07,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:07,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-26 22:22:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:07,359 INFO L225 Difference]: With dead ends: 1629 [2019-12-26 22:22:07,360 INFO L226 Difference]: Without dead ends: 1629 [2019-12-26 22:22:07,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 22:22:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-26 22:22:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-26 22:22:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-26 22:22:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-26 22:22:07,389 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-26 22:22:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:07,389 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-26 22:22:07,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-26 22:22:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:22:07,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:07,393 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] [2019-12-26 22:22:07,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-26 22:22:07,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:07,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965702648] [2019-12-26 22:22:07,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:07,830 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-26 22:22:07,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965702648] [2019-12-26 22:22:07,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:07,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:22:07,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352393791] [2019-12-26 22:22:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:22:07,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:22:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:22:07,832 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 13 states. [2019-12-26 22:22:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:08,918 INFO L93 Difference]: Finished difference Result 1933 states and 4015 transitions. [2019-12-26 22:22:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:22:08,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-12-26 22:22:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:08,925 INFO L225 Difference]: With dead ends: 1933 [2019-12-26 22:22:08,926 INFO L226 Difference]: Without dead ends: 1933 [2019-12-26 22:22:08,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:22:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-26 22:22:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1254. [2019-12-26 22:22:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-12-26 22:22:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2686 transitions. [2019-12-26 22:22:08,956 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2686 transitions. Word has length 51 [2019-12-26 22:22:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:08,956 INFO L462 AbstractCegarLoop]: Abstraction has 1254 states and 2686 transitions. [2019-12-26 22:22:08,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:22:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2686 transitions. [2019-12-26 22:22:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:22:08,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:08,960 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] [2019-12-26 22:22:08,960 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-26 22:22:08,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:08,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519975462] [2019-12-26 22:22:08,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:09,029 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-26 22:22:09,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519975462] [2019-12-26 22:22:09,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:09,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:09,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338003504] [2019-12-26 22:22:09,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:09,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:09,031 INFO L87 Difference]: Start difference. First operand 1254 states and 2686 transitions. Second operand 3 states. [2019-12-26 22:22:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:09,067 INFO L93 Difference]: Finished difference Result 1253 states and 2684 transitions. [2019-12-26 22:22:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:09,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:22:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:09,071 INFO L225 Difference]: With dead ends: 1253 [2019-12-26 22:22:09,071 INFO L226 Difference]: Without dead ends: 1253 [2019-12-26 22:22:09,071 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-26 22:22:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-26 22:22:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 995. [2019-12-26 22:22:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-26 22:22:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2166 transitions. [2019-12-26 22:22:09,098 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2166 transitions. Word has length 51 [2019-12-26 22:22:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2166 transitions. [2019-12-26 22:22:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2166 transitions. [2019-12-26 22:22:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:22:09,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:09,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:09,102 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-26 22:22:09,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:09,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873894699] [2019-12-26 22:22:09,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:22:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:22:09,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:22:09,301 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:22:09,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 22:22:09,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 22:22:09,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In489138059 ~z$w_buff1~0_Out489138059) (= ~z$w_buff0_used~0_Out489138059 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out489138059| 1) (= |P0Thread1of1ForFork0_#in~arg.base_In489138059| P0Thread1of1ForFork0_~arg.base_Out489138059) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out489138059| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out489138059) (= ~z$w_buff1_used~0_Out489138059 ~z$w_buff0_used~0_In489138059) (= 0 (mod ~z$w_buff1_used~0_Out489138059 256)) (= 1 ~z$w_buff0~0_Out489138059) (= P0Thread1of1ForFork0_~arg.offset_Out489138059 |P0Thread1of1ForFork0_#in~arg.offset_In489138059|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In489138059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In489138059, ~z$w_buff0~0=~z$w_buff0~0_In489138059, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In489138059|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In489138059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out489138059, ~z$w_buff0~0=~z$w_buff0~0_Out489138059, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out489138059, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out489138059, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In489138059|, ~z$w_buff1~0=~z$w_buff1~0_Out489138059, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out489138059, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out489138059|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out489138059} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:22:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1973838123 256) 0))) (or (and .cse0 (= ~z$w_buff1_used~0_In-1973838123 |P1Thread1of1ForFork1_#t~ite23_Out-1973838123|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1973838123 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1973838123 256))) (= (mod ~z$w_buff0_used~0_In-1973838123 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-1973838123 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1973838123| |P1Thread1of1ForFork1_#t~ite23_Out-1973838123|)) (and (not .cse0) (= ~z$w_buff1_used~0_In-1973838123 |P1Thread1of1ForFork1_#t~ite24_Out-1973838123|) (= |P1Thread1of1ForFork1_#t~ite23_In-1973838123| |P1Thread1of1ForFork1_#t~ite23_Out-1973838123|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1973838123, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1973838123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1973838123, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1973838123|, ~weak$$choice2~0=~weak$$choice2~0_In-1973838123, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1973838123} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1973838123, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1973838123, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1973838123|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1973838123, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1973838123|, ~weak$$choice2~0=~weak$$choice2~0_In-1973838123, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1973838123} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-26 22:22:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 22:22:09,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:22:09,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1946227882 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1946227882 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1946227882|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1946227882| ~z$w_buff0_used~0_In1946227882)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1946227882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1946227882} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1946227882|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1946227882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1946227882} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:22:09,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2136753481 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In2136753481 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In2136753481 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2136753481 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2136753481|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2136753481 |P0Thread1of1ForFork0_#t~ite6_Out2136753481|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2136753481, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2136753481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2136753481, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2136753481} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2136753481|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2136753481, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2136753481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2136753481, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2136753481} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:22:09,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In422916647 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In422916647 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In422916647 ~z$r_buff0_thd1~0_Out422916647) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out422916647) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In422916647, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In422916647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In422916647, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out422916647|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out422916647} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:22:09,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In521638511 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In521638511 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In521638511 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In521638511 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out521638511| ~z$r_buff1_thd1~0_In521638511) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out521638511| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In521638511, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In521638511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In521638511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In521638511} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In521638511, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out521638511|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In521638511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In521638511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In521638511} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:22:09,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out744878740| |P1Thread1of1ForFork1_#t~ite32_Out744878740|)) (.cse2 (= (mod ~z$w_buff1_used~0_In744878740 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In744878740 256)))) (or (and (= ~z$w_buff1~0_In744878740 |P1Thread1of1ForFork1_#t~ite32_Out744878740|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~z~0_In744878740 |P1Thread1of1ForFork1_#t~ite32_Out744878740|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In744878740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In744878740, ~z$w_buff1~0=~z$w_buff1~0_In744878740, ~z~0=~z~0_In744878740} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In744878740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In744878740, ~z$w_buff1~0=~z$w_buff1~0_In744878740, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out744878740|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out744878740|, ~z~0=~z~0_In744878740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:22:09,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1964942787 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1964942787 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1964942787|)) (and (= ~z$w_buff0_used~0_In-1964942787 |P1Thread1of1ForFork1_#t~ite34_Out-1964942787|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1964942787, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1964942787} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1964942787, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1964942787|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1964942787} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:22:09,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-356087363 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-356087363 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-356087363 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-356087363 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-356087363| ~z$w_buff1_used~0_In-356087363)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-356087363|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-356087363, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-356087363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-356087363, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-356087363} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-356087363, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-356087363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-356087363, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-356087363|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-356087363} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:22:09,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1882294607 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1882294607 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1882294607| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1882294607| ~z$r_buff0_thd2~0_In-1882294607) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1882294607, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1882294607} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1882294607, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1882294607, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1882294607|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:22:09,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In884354293 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In884354293 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In884354293 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In884354293 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In884354293 |P1Thread1of1ForFork1_#t~ite37_Out884354293|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out884354293| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In884354293, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In884354293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884354293, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In884354293} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In884354293, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In884354293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884354293, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In884354293, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out884354293|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:22:09,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:22:09,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:22:09,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 22:22:09,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In946645426 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In946645426 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In946645426 |ULTIMATE.start_main_#t~ite40_Out946645426|) (not .cse1)) (and (= ~z~0_In946645426 |ULTIMATE.start_main_#t~ite40_Out946645426|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In946645426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In946645426, ~z$w_buff1~0=~z$w_buff1~0_In946645426, ~z~0=~z~0_In946645426} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out946645426|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In946645426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In946645426, ~z$w_buff1~0=~z$w_buff1~0_In946645426, ~z~0=~z~0_In946645426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:22:09,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-26 22:22:09,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-607658197 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-607658197 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-607658197 |ULTIMATE.start_main_#t~ite42_Out-607658197|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-607658197|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-607658197, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-607658197} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-607658197, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-607658197, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-607658197|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:22:09,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-2092464020 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2092464020 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2092464020 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2092464020 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-2092464020| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-2092464020| ~z$w_buff1_used~0_In-2092464020)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2092464020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2092464020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2092464020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092464020} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2092464020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2092464020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2092464020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092464020, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2092464020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:22:09,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-819168565 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-819168565 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-819168565 |ULTIMATE.start_main_#t~ite44_Out-819168565|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-819168565|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819168565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819168565} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819168565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819168565, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-819168565|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:22:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2055682708 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2055682708 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2055682708 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2055682708 256)))) (or (and (= ~z$r_buff1_thd0~0_In2055682708 |ULTIMATE.start_main_#t~ite45_Out2055682708|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out2055682708|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2055682708, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2055682708, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2055682708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2055682708} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2055682708, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2055682708, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2055682708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2055682708, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2055682708|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:22:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:22:09,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:22:09 BasicIcfg [2019-12-26 22:22:09,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:22:09,440 INFO L168 Benchmark]: Toolchain (without parser) took 14285.80 ms. Allocated memory was 144.7 MB in the beginning and 436.7 MB in the end (delta: 292.0 MB). Free memory was 99.4 MB in the beginning and 120.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 270.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,441 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.38 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 156.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.69 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,446 INFO L168 Benchmark]: Boogie Preprocessor took 34.90 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,447 INFO L168 Benchmark]: RCFGBuilder took 781.22 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 106.4 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,448 INFO L168 Benchmark]: TraceAbstraction took 12620.34 ms. Allocated memory was 201.9 MB in the beginning and 436.7 MB in the end (delta: 234.9 MB). Free memory was 106.4 MB in the beginning and 120.9 MB in the end (delta: -14.6 MB). Peak memory consumption was 220.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:22:09,455 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.38 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 156.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.69 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.90 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.22 ms. Allocated memory is still 201.9 MB. Free memory was 151.4 MB in the beginning and 106.4 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12620.34 ms. Allocated memory was 201.9 MB in the beginning and 436.7 MB in the end (delta: 234.9 MB). Free memory was 106.4 MB in the beginning and 120.9 MB in the end (delta: -14.6 MB). Peak memory consumption was 220.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1795 SDtfs, 1473 SDslu, 3490 SDs, 0 SdLazy, 2263 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 58175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...