/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:40,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:40,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:40,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:40,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:40,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:40,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:40,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:40,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:40,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:40,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:40,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:40,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:40,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:40,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:40,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:40,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:40,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:40,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:40,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:40,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:40,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:40,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:40,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:40,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:40,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:40,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:40,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:40,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:40,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:40,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:40,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:40,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:40,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:40,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:40,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:40,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:40,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:40,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:40,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:40,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:40,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:03:40,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:40,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:40,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:40,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:40,843 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:40,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:40,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:40,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:40,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:40,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:40,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:40,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:40,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:40,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:40,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:40,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:40,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:40,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:40,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:40,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:40,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:40,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:40,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:40,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:40,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:40,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:40,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:40,850 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:40,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:40,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:41,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:41,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:41,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:41,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:41,176 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:41,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-18 22:03:41,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4d13026/632e52beaf7a457ca4579d3a25560674/FLAG20d9579a1 [2019-12-18 22:03:41,751 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:41,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-18 22:03:41,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4d13026/632e52beaf7a457ca4579d3a25560674/FLAG20d9579a1 [2019-12-18 22:03:42,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4d13026/632e52beaf7a457ca4579d3a25560674 [2019-12-18 22:03:42,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:42,032 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:42,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:42,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:42,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:42,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42, skipping insertion in model container [2019-12-18 22:03:42,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:42,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:42,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:42,645 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:42,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:42,809 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:42,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42 WrapperNode [2019-12-18 22:03:42,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:42,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:42,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:42,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:42,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:42,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:42,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:42,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:03:42,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... [2019-12-18 22:03:42,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:03:42,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:03:42,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:03:42,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:03:42,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:03:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:03:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:03:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:03:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:03:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:03:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:03:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:03:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:03:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:03:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:03:42,985 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:03:43,646 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:03:43,647 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:03:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:43 BoogieIcfgContainer [2019-12-18 22:03:43,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:03:43,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:03:43,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:03:43,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:03:43,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:42" (1/3) ... [2019-12-18 22:03:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce7fb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:43, skipping insertion in model container [2019-12-18 22:03:43,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:42" (2/3) ... [2019-12-18 22:03:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce7fb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:43, skipping insertion in model container [2019-12-18 22:03:43,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:43" (3/3) ... [2019-12-18 22:03:43,656 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt.i [2019-12-18 22:03:43,668 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:03:43,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:03:43,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:03:43,678 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:03:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,764 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:43,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:03:43,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:03:43,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:03:43,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:03:43,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:03:43,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:03:43,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:03:43,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:03:43,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:03:43,849 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 22:03:43,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:43,923 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:43,923 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:43,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:43,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:44,032 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:44,032 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:44,041 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:44,055 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 22:03:44,056 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:03:47,025 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:03:47,142 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:03:47,192 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-18 22:03:47,192 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 22:03:47,195 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-18 22:03:47,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-18 22:03:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-18 22:03:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:03:47,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:47,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:03:47,598 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-18 22:03:47,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:47,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856537230] [2019-12-18 22:03:47,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:47,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856537230] [2019-12-18 22:03:47,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:47,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:47,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355407108] [2019-12-18 22:03:47,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:47,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:47,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:47,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:47,868 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-18 22:03:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:48,122 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-18 22:03:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:48,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:03:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:48,204 INFO L225 Difference]: With dead ends: 6863 [2019-12-18 22:03:48,205 INFO L226 Difference]: Without dead ends: 6460 [2019-12-18 22:03:48,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-18 22:03:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-18 22:03:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-18 22:03:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-18 22:03:48,563 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-18 22:03:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:48,563 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-18 22:03:48,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-18 22:03:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:03:48,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:48,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:48,581 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-18 22:03:48,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:48,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716043486] [2019-12-18 22:03:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:48,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716043486] [2019-12-18 22:03:48,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:48,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:48,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844653889] [2019-12-18 22:03:48,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:48,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:48,735 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-18 22:03:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:49,174 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-18 22:03:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:49,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:03:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:49,258 INFO L225 Difference]: With dead ends: 9760 [2019-12-18 22:03:49,258 INFO L226 Difference]: Without dead ends: 9746 [2019-12-18 22:03:49,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-18 22:03:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-18 22:03:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-18 22:03:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-18 22:03:49,603 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-18 22:03:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:49,604 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-18 22:03:49,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-18 22:03:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:49,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:49,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:49,608 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-18 22:03:49,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:49,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689292787] [2019-12-18 22:03:49,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:49,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689292787] [2019-12-18 22:03:49,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:49,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:49,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225974959] [2019-12-18 22:03:49,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:49,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:49,702 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-18 22:03:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:49,820 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-18 22:03:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:03:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:49,964 INFO L225 Difference]: With dead ends: 12018 [2019-12-18 22:03:49,964 INFO L226 Difference]: Without dead ends: 12018 [2019-12-18 22:03:49,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-18 22:03:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-18 22:03:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-18 22:03:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-18 22:03:50,324 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-18 22:03:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:50,325 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-18 22:03:50,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-18 22:03:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:50,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:50,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:50,329 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:50,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-18 22:03:50,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:50,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431868812] [2019-12-18 22:03:50,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:50,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431868812] [2019-12-18 22:03:50,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:50,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:50,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445953560] [2019-12-18 22:03:50,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:50,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:50,385 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-18 22:03:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:51,131 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-18 22:03:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:51,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:51,175 INFO L225 Difference]: With dead ends: 13296 [2019-12-18 22:03:51,175 INFO L226 Difference]: Without dead ends: 13285 [2019-12-18 22:03:51,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-18 22:03:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-18 22:03:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-18 22:03:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-18 22:03:51,524 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-18 22:03:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:51,524 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-18 22:03:51,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-18 22:03:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:51,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:51,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:51,528 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-18 22:03:51,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:51,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861255003] [2019-12-18 22:03:51,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:51,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861255003] [2019-12-18 22:03:51,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:51,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:51,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304128112] [2019-12-18 22:03:51,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:51,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:51,581 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-18 22:03:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:51,799 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-18 22:03:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:51,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:51,964 INFO L225 Difference]: With dead ends: 14351 [2019-12-18 22:03:51,964 INFO L226 Difference]: Without dead ends: 14338 [2019-12-18 22:03:51,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-18 22:03:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-18 22:03:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-18 22:03:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-18 22:03:52,327 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-18 22:03:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:52,327 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-18 22:03:52,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-18 22:03:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:03:52,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:52,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:52,334 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-18 22:03:52,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:52,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193479145] [2019-12-18 22:03:52,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:52,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193479145] [2019-12-18 22:03:52,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:52,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415926597] [2019-12-18 22:03:52,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:52,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:52,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:52,376 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-18 22:03:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:52,439 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-18 22:03:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:03:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:52,481 INFO L225 Difference]: With dead ends: 12224 [2019-12-18 22:03:52,481 INFO L226 Difference]: Without dead ends: 12224 [2019-12-18 22:03:52,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-18 22:03:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-18 22:03:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-18 22:03:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-18 22:03:52,929 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-18 22:03:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:52,929 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-18 22:03:52,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-18 22:03:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:03:52,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:52,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:52,936 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-18 22:03:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394699838] [2019-12-18 22:03:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:52,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394699838] [2019-12-18 22:03:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580821364] [2019-12-18 22:03:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:52,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:52,999 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 4 states. [2019-12-18 22:03:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:53,043 INFO L93 Difference]: Finished difference Result 2579 states and 6836 transitions. [2019-12-18 22:03:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:03:53,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:03:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:53,048 INFO L225 Difference]: With dead ends: 2579 [2019-12-18 22:03:53,049 INFO L226 Difference]: Without dead ends: 1835 [2019-12-18 22:03:53,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-18 22:03:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-12-18 22:03:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-12-18 22:03:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4472 transitions. [2019-12-18 22:03:53,080 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4472 transitions. Word has length 17 [2019-12-18 22:03:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,080 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4472 transitions. [2019-12-18 22:03:53,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4472 transitions. [2019-12-18 22:03:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:53,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,084 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-18 22:03:53,084 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-18 22:03:53,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744965992] [2019-12-18 22:03:53,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:53,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744965992] [2019-12-18 22:03:53,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:53,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006681434] [2019-12-18 22:03:53,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:53,126 INFO L87 Difference]: Start difference. First operand 1835 states and 4472 transitions. Second operand 3 states. [2019-12-18 22:03:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:53,169 INFO L93 Difference]: Finished difference Result 2395 states and 5562 transitions. [2019-12-18 22:03:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:53,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 22:03:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:53,174 INFO L225 Difference]: With dead ends: 2395 [2019-12-18 22:03:53,174 INFO L226 Difference]: Without dead ends: 2395 [2019-12-18 22:03:53,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-18 22:03:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1775. [2019-12-18 22:03:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-18 22:03:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 4059 transitions. [2019-12-18 22:03:53,204 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 4059 transitions. Word has length 26 [2019-12-18 22:03:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,205 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 4059 transitions. [2019-12-18 22:03:53,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 4059 transitions. [2019-12-18 22:03:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:53,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,208 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-18 22:03:53,208 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-18 22:03:53,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126767133] [2019-12-18 22:03:53,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:53,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126767133] [2019-12-18 22:03:53,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:53,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:53,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893765784] [2019-12-18 22:03:53,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:53,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:53,322 INFO L87 Difference]: Start difference. First operand 1775 states and 4059 transitions. Second operand 5 states. [2019-12-18 22:03:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:53,501 INFO L93 Difference]: Finished difference Result 2308 states and 5281 transitions. [2019-12-18 22:03:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:53,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:03:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:53,506 INFO L225 Difference]: With dead ends: 2308 [2019-12-18 22:03:53,506 INFO L226 Difference]: Without dead ends: 2306 [2019-12-18 22:03:53,506 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-18 22:03:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-18 22:03:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1867. [2019-12-18 22:03:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-18 22:03:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4281 transitions. [2019-12-18 22:03:53,541 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4281 transitions. Word has length 26 [2019-12-18 22:03:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,542 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4281 transitions. [2019-12-18 22:03:53,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4281 transitions. [2019-12-18 22:03:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:53,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,545 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-18 22:03:53,545 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-18 22:03:53,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897364988] [2019-12-18 22:03:53,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:53,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897364988] [2019-12-18 22:03:53,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:53,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:03:53,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051481622] [2019-12-18 22:03:53,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:53,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:53,620 INFO L87 Difference]: Start difference. First operand 1867 states and 4281 transitions. Second operand 5 states. [2019-12-18 22:03:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,018 INFO L93 Difference]: Finished difference Result 2686 states and 6070 transitions. [2019-12-18 22:03:54,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:03:54,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:03:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,022 INFO L225 Difference]: With dead ends: 2686 [2019-12-18 22:03:54,022 INFO L226 Difference]: Without dead ends: 2686 [2019-12-18 22:03:54,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-18 22:03:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2223. [2019-12-18 22:03:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-18 22:03:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 5041 transitions. [2019-12-18 22:03:54,088 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 5041 transitions. Word has length 26 [2019-12-18 22:03:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 5041 transitions. [2019-12-18 22:03:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 5041 transitions. [2019-12-18 22:03:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:03:54,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,093 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-18 22:03:54,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-18 22:03:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231782044] [2019-12-18 22:03:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:54,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231782044] [2019-12-18 22:03:54,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:54,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812335027] [2019-12-18 22:03:54,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:54,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:54,151 INFO L87 Difference]: Start difference. First operand 2223 states and 5041 transitions. Second operand 5 states. [2019-12-18 22:03:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,355 INFO L93 Difference]: Finished difference Result 2722 states and 6169 transitions. [2019-12-18 22:03:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:54,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:03:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,359 INFO L225 Difference]: With dead ends: 2722 [2019-12-18 22:03:54,359 INFO L226 Difference]: Without dead ends: 2720 [2019-12-18 22:03:54,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-12-18 22:03:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2200. [2019-12-18 22:03:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-12-18 22:03:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 4966 transitions. [2019-12-18 22:03:54,397 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 4966 transitions. Word has length 27 [2019-12-18 22:03:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,397 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 4966 transitions. [2019-12-18 22:03:54,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 4966 transitions. [2019-12-18 22:03:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:03:54,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,401 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-18 22:03:54,401 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-18 22:03:54,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004520084] [2019-12-18 22:03:54,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:54,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004520084] [2019-12-18 22:03:54,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:03:54,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391725285] [2019-12-18 22:03:54,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:54,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:54,497 INFO L87 Difference]: Start difference. First operand 2200 states and 4966 transitions. Second operand 5 states. [2019-12-18 22:03:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,549 INFO L93 Difference]: Finished difference Result 1268 states and 2647 transitions. [2019-12-18 22:03:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:54,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:03:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,552 INFO L225 Difference]: With dead ends: 1268 [2019-12-18 22:03:54,552 INFO L226 Difference]: Without dead ends: 1125 [2019-12-18 22:03:54,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-12-18 22:03:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 981. [2019-12-18 22:03:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-18 22:03:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2051 transitions. [2019-12-18 22:03:54,566 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2051 transitions. Word has length 27 [2019-12-18 22:03:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,567 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2051 transitions. [2019-12-18 22:03:54,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2051 transitions. [2019-12-18 22:03:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:54,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,570 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] [2019-12-18 22:03:54,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 464634158, now seen corresponding path program 1 times [2019-12-18 22:03:54,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564474486] [2019-12-18 22:03:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:54,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564474486] [2019-12-18 22:03:54,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:54,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202258997] [2019-12-18 22:03:54,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:54,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:54,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:54,672 INFO L87 Difference]: Start difference. First operand 981 states and 2051 transitions. Second operand 4 states. [2019-12-18 22:03:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,695 INFO L93 Difference]: Finished difference Result 1723 states and 3617 transitions. [2019-12-18 22:03:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:03:54,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 22:03:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,699 INFO L225 Difference]: With dead ends: 1723 [2019-12-18 22:03:54,699 INFO L226 Difference]: Without dead ends: 770 [2019-12-18 22:03:54,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-12-18 22:03:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2019-12-18 22:03:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-18 22:03:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1614 transitions. [2019-12-18 22:03:54,715 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1614 transitions. Word has length 41 [2019-12-18 22:03:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,715 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1614 transitions. [2019-12-18 22:03:54,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1614 transitions. [2019-12-18 22:03:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:54,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:54,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 602720702, now seen corresponding path program 2 times [2019-12-18 22:03:54,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653910690] [2019-12-18 22:03:54,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:54,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653910690] [2019-12-18 22:03:54,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:54,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300451636] [2019-12-18 22:03:54,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:03:54,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:03:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:54,827 INFO L87 Difference]: Start difference. First operand 770 states and 1614 transitions. Second operand 7 states. [2019-12-18 22:03:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,994 INFO L93 Difference]: Finished difference Result 1263 states and 2581 transitions. [2019-12-18 22:03:54,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:03:54,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 22:03:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,996 INFO L225 Difference]: With dead ends: 1263 [2019-12-18 22:03:54,997 INFO L226 Difference]: Without dead ends: 827 [2019-12-18 22:03:54,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:03:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-12-18 22:03:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 783. [2019-12-18 22:03:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-18 22:03:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1614 transitions. [2019-12-18 22:03:55,010 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1614 transitions. Word has length 41 [2019-12-18 22:03:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:55,010 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1614 transitions. [2019-12-18 22:03:55,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:03:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1614 transitions. [2019-12-18 22:03:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:55,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,013 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] [2019-12-18 22:03:55,013 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 261585982, now seen corresponding path program 3 times [2019-12-18 22:03:55,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785309326] [2019-12-18 22:03:55,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:55,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785309326] [2019-12-18 22:03:55,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:55,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:55,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409426568] [2019-12-18 22:03:55,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:03:55,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:03:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:55,134 INFO L87 Difference]: Start difference. First operand 783 states and 1614 transitions. Second operand 6 states. [2019-12-18 22:03:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:55,526 INFO L93 Difference]: Finished difference Result 913 states and 1857 transitions. [2019-12-18 22:03:55,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:55,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:03:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:55,528 INFO L225 Difference]: With dead ends: 913 [2019-12-18 22:03:55,529 INFO L226 Difference]: Without dead ends: 913 [2019-12-18 22:03:55,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:03:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-18 22:03:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 813. [2019-12-18 22:03:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-18 22:03:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1669 transitions. [2019-12-18 22:03:55,542 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1669 transitions. Word has length 41 [2019-12-18 22:03:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:55,542 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1669 transitions. [2019-12-18 22:03:55,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:03:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1669 transitions. [2019-12-18 22:03:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:55,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,544 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] [2019-12-18 22:03:55,544 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -645645490, now seen corresponding path program 4 times [2019-12-18 22:03:55,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664577392] [2019-12-18 22:03:55,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:55,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664577392] [2019-12-18 22:03:55,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:55,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:55,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775195204] [2019-12-18 22:03:55,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:55,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:55,603 INFO L87 Difference]: Start difference. First operand 813 states and 1669 transitions. Second operand 3 states. [2019-12-18 22:03:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:55,616 INFO L93 Difference]: Finished difference Result 811 states and 1664 transitions. [2019-12-18 22:03:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:55,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:03:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:55,617 INFO L225 Difference]: With dead ends: 811 [2019-12-18 22:03:55,617 INFO L226 Difference]: Without dead ends: 811 [2019-12-18 22:03:55,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-18 22:03:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 670. [2019-12-18 22:03:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 22:03:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1397 transitions. [2019-12-18 22:03:55,627 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1397 transitions. Word has length 41 [2019-12-18 22:03:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:55,628 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1397 transitions. [2019-12-18 22:03:55,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1397 transitions. [2019-12-18 22:03:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:03:55,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,630 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] [2019-12-18 22:03:55,630 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 1 times [2019-12-18 22:03:55,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114225460] [2019-12-18 22:03:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:55,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:03:55,749 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:03:55,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19|)) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19| 1)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0))) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (= |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0) (= 0 v_~y$r_buff1_thd2~0_17) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1651~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_~#t1651~0.base=|v_ULTIMATE.start_main_~#t1651~0.base_19|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1651~0.offset=|v_ULTIMATE.start_main_~#t1651~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1651~0.base, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1652~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1652~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1651~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:03:55,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9| 1)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1652~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1652~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9|) |v_ULTIMATE.start_main_~#t1652~0.offset_8| 1))) (not (= |v_ULTIMATE.start_main_~#t1652~0.base_9| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1652~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1652~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1652~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:03:55,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:03:55,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1118439706 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1118439706 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1118439706|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1118439706 |P1Thread1of1ForFork0_#t~ite28_Out1118439706|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1118439706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1118439706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1118439706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1118439706, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1118439706|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:03:55,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In624402485 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In624402485 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In624402485 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In624402485 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out624402485|)) (and (= ~y$w_buff1_used~0_In624402485 |P1Thread1of1ForFork0_#t~ite29_Out624402485|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In624402485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In624402485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In624402485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In624402485} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In624402485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In624402485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In624402485, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out624402485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In624402485} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:03:55,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In148534158 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In148534158 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In148534158 ~y$r_buff0_thd2~0_Out148534158)) (and (= 0 ~y$r_buff0_thd2~0_Out148534158) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In148534158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In148534158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In148534158, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out148534158|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out148534158} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:03:55,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In45718487 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite17_In45718487| |P0Thread1of1ForFork1_#t~ite17_Out45718487|) (= ~y$w_buff1_used~0_In45718487 |P0Thread1of1ForFork1_#t~ite18_Out45718487|)) (and (= ~y$w_buff1_used~0_In45718487 |P0Thread1of1ForFork1_#t~ite17_Out45718487|) (= |P0Thread1of1ForFork1_#t~ite18_Out45718487| |P0Thread1of1ForFork1_#t~ite17_Out45718487|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In45718487 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In45718487 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd1~0_In45718487 256)) .cse1) (= (mod ~y$w_buff0_used~0_In45718487 256) 0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In45718487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In45718487, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In45718487, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In45718487|, ~weak$$choice2~0=~weak$$choice2~0_In45718487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45718487} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In45718487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In45718487, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In45718487, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out45718487|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out45718487|, ~weak$$choice2~0=~weak$$choice2~0_In45718487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45718487} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:03:55,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:03:55,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:03:55,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In787516145 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In787516145 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In787516145 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In787516145 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In787516145 |P1Thread1of1ForFork0_#t~ite31_Out787516145|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out787516145|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In787516145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In787516145, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787516145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787516145} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In787516145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In787516145, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out787516145|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787516145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787516145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:03:55,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:03:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:03:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1125168633 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1125168633 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out1125168633| ~y$w_buff1~0_In1125168633) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite34_Out1125168633| ~y~0_In1125168633)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1125168633, ~y~0=~y~0_In1125168633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1125168633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1125168633} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1125168633, ~y~0=~y~0_In1125168633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1125168633, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1125168633|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1125168633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1210447755 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1210447755 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1210447755|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1210447755 |ULTIMATE.start_main_#t~ite36_Out1210447755|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1210447755, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1210447755} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1210447755, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1210447755, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1210447755|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 22:03:55,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1262076945 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1262076945 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1262076945 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1262076945 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1262076945|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1262076945 |ULTIMATE.start_main_#t~ite37_Out1262076945|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1262076945, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1262076945, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1262076945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1262076945} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1262076945, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1262076945, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1262076945|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1262076945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1262076945} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 22:03:55,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In286671423 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In286671423 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In286671423 |ULTIMATE.start_main_#t~ite38_Out286671423|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out286671423|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In286671423, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286671423} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In286671423, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286671423, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out286671423|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:03:55,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-627964953 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-627964953 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-627964953 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-627964953 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-627964953| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-627964953 |ULTIMATE.start_main_#t~ite39_Out-627964953|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-627964953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-627964953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-627964953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-627964953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-627964953, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-627964953|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-627964953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-627964953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-627964953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 22:03:55,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:03:55,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:55 BasicIcfg [2019-12-18 22:03:55,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:55,849 INFO L168 Benchmark]: Toolchain (without parser) took 13817.29 ms. Allocated memory was 145.8 MB in the beginning and 588.3 MB in the end (delta: 442.5 MB). Free memory was 101.0 MB in the beginning and 183.1 MB in the end (delta: -82.1 MB). Peak memory consumption was 360.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,850 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.44 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 157.9 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,852 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 ms. Allocated memory is still 203.4 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,853 INFO L168 Benchmark]: RCFGBuilder took 734.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 111.9 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,854 INFO L168 Benchmark]: TraceAbstraction took 12198.11 ms. Allocated memory was 203.4 MB in the beginning and 588.3 MB in the end (delta: 384.8 MB). Free memory was 111.9 MB in the beginning and 183.1 MB in the end (delta: -71.2 MB). Peak memory consumption was 313.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,858 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.44 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.44 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 157.9 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.26 ms. Allocated memory is still 203.4 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 734.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 111.9 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12198.11 ms. Allocated memory was 203.4 MB in the beginning and 588.3 MB in the end (delta: 384.8 MB). Free memory was 111.9 MB in the beginning and 183.1 MB in the end (delta: -71.2 MB). Peak memory consumption was 313.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1651, ((void *)0), P0, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1652, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1816 SDtfs, 1574 SDslu, 2871 SDs, 0 SdLazy, 1548 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 7555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 31622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...