/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/safe033_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:09:55,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:09:55,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:09:55,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:09:55,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:09:55,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:09:55,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:09:55,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:09:55,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:09:55,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:09:55,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:09:55,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:09:55,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:09:55,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:09:55,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:09:55,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:09:55,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:09:55,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:09:55,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:09:55,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:09:55,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:09:55,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:09:55,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:09:55,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:09:55,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:09:55,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:09:55,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:09:55,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:09:55,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:09:55,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:09:55,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:09:55,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:09:55,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:09:55,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:09:55,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:09:55,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:09:55,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:09:55,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:09:55,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:09:55,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:09:55,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:09:55,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:09:55,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:09:55,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:09:55,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:09:55,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:09:55,702 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:09:55,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:09:55,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:09:55,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:09:55,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:09:55,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:09:55,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:09:55,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:09:55,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:09:55,704 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:09:55,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:09:55,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:09:55,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:09:55,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:09:55,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:09:55,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:09:55,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:09:55,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:09:55,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:09:55,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:09:55,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:09:55,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:09:55,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:09:55,707 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:09:55,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:09:55,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:09:55,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:09:55,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:09:55,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:09:55,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:09:55,996 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:09:55,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 08:09:56,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd30dba0/696a69269b024fba9594cc7b0f926f1d/FLAG50e3e4902 [2019-12-27 08:09:56,629 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:09:56,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 08:09:56,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd30dba0/696a69269b024fba9594cc7b0f926f1d/FLAG50e3e4902 [2019-12-27 08:09:56,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd30dba0/696a69269b024fba9594cc7b0f926f1d [2019-12-27 08:09:56,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:09:56,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:09:56,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:09:56,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:09:56,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:09:56,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:09:56" (1/1) ... [2019-12-27 08:09:56,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:56, skipping insertion in model container [2019-12-27 08:09:56,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:09:56" (1/1) ... [2019-12-27 08:09:56,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:09:56,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:09:57,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:09:57,511 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:09:57,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:09:57,657 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:09:57,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57 WrapperNode [2019-12-27 08:09:57,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:09:57,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:09:57,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:09:57,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:09:57,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:09:57,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:09:57,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:09:57,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:09:57,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... [2019-12-27 08:09:57,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:09:57,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:09:57,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:09:57,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:09:57,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:09:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:09:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:09:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:09:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:09:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:09:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:09:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:09:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:09:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:09:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:09:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:09:57,826 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:09:58,485 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:09:58,486 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:09:58,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:09:58 BoogieIcfgContainer [2019-12-27 08:09:58,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:09:58,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:09:58,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:09:58,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:09:58,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:09:56" (1/3) ... [2019-12-27 08:09:58,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:09:58, skipping insertion in model container [2019-12-27 08:09:58,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:09:57" (2/3) ... [2019-12-27 08:09:58,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:09:58, skipping insertion in model container [2019-12-27 08:09:58,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:09:58" (3/3) ... [2019-12-27 08:09:58,495 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-27 08:09:58,506 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:09:58,506 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:09:58,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:09:58,515 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:09:58,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:09:58,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:09:58,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:09:58,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:09:58,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:09:58,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:09:58,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:09:58,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:09:58,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:09:58,642 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:09:58,659 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 08:09:58,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 08:09:58,794 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 08:09:58,794 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:09:58,810 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 08:09:58,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 08:09:58,899 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 08:09:58,899 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:09:58,907 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 08:09:58,922 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 08:09:58,923 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:10:01,952 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 08:10:02,089 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 08:10:02,202 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-27 08:10:02,202 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 08:10:02,207 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-27 08:10:02,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-27 08:10:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-27 08:10:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:10:02,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:02,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:10:02,593 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-27 08:10:02,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:02,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960324608] [2019-12-27 08:10:02,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:02,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-27 08:10:02,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960324608] [2019-12-27 08:10:02,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:02,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:10:02,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831834500] [2019-12-27 08:10:02,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:02,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:02,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:02,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:02,863 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-27 08:10:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:03,116 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 08:10:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:03,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:10:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:03,187 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 08:10:03,187 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 08:10:03,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 08:10:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 08:10:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 08:10:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 08:10:03,601 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 08:10:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:03,601 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 08:10:03,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 08:10:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:10:03,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:03,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:03,605 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-27 08:10:03,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:03,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390899197] [2019-12-27 08:10:03,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:03,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390899197] [2019-12-27 08:10:03,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:03,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:03,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480016897] [2019-12-27 08:10:03,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:03,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:03,694 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 08:10:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:03,738 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 08:10:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:03,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 08:10:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:03,745 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 08:10:03,746 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 08:10:03,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 08:10:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 08:10:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 08:10:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 08:10:03,781 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 08:10:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:03,781 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 08:10:03,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 08:10:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:03,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:03,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:03,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:03,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:03,789 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-27 08:10:03,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:03,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658721792] [2019-12-27 08:10:03,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:03,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658721792] [2019-12-27 08:10:03,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:03,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:03,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790685888] [2019-12-27 08:10:03,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:03,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:03,878 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-27 08:10:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:03,948 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 08:10:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:03,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 08:10:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:03,959 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 08:10:03,959 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 08:10:03,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 08:10:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 08:10:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 08:10:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 08:10:04,003 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 08:10:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:04,004 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 08:10:04,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 08:10:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:04,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:04,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:04,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-27 08:10:04,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:04,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704722858] [2019-12-27 08:10:04,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:04,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704722858] [2019-12-27 08:10:04,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:04,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:04,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85771379] [2019-12-27 08:10:04,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:04,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:04,123 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-27 08:10:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:04,289 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 08:10:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:10:04,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:10:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:04,303 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 08:10:04,303 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 08:10:04,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:10:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 08:10:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 08:10:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 08:10:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 08:10:04,358 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 08:10:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:04,359 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 08:10:04,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 08:10:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:04,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:04,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:04,361 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-27 08:10:04,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:04,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414318371] [2019-12-27 08:10:04,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:04,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414318371] [2019-12-27 08:10:04,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:04,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:04,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718741785] [2019-12-27 08:10:04,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:04,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:04,428 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-27 08:10:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:04,642 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 08:10:04,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:10:04,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:10:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:04,662 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 08:10:04,662 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 08:10:04,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:10:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 08:10:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 08:10:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 08:10:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 08:10:04,712 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 08:10:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:04,713 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 08:10:04,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 08:10:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:10:04,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:04,716 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-27 08:10:04,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-27 08:10:04,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:04,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632559043] [2019-12-27 08:10:04,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:04,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632559043] [2019-12-27 08:10:04,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:04,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:04,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916007137] [2019-12-27 08:10:04,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:04,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:04,863 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-27 08:10:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:04,885 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 08:10:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:10:04,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 08:10:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:04,891 INFO L225 Difference]: With dead ends: 772 [2019-12-27 08:10:04,891 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 08:10:04,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 08:10:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 08:10:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 08:10:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 08:10:04,915 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 08:10:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:04,916 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 08:10:04,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 08:10:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:04,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:04,920 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-27 08:10:04,920 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-27 08:10:04,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:04,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457232121] [2019-12-27 08:10:04,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457232121] [2019-12-27 08:10:05,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:05,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:05,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58539433] [2019-12-27 08:10:05,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:05,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:05,046 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-27 08:10:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:05,058 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 08:10:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:05,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:05,061 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 08:10:05,062 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 08:10:05,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 08:10:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 08:10:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 08:10:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 08:10:05,073 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 08:10:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:05,074 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 08:10:05,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 08:10:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:05,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:05,078 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-27 08:10:05,078 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-27 08:10:05,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:05,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218552549] [2019-12-27 08:10:05,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:05,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218552549] [2019-12-27 08:10:05,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:05,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:10:05,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607173611] [2019-12-27 08:10:05,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:10:05,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:10:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:10:05,212 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-27 08:10:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:05,359 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-27 08:10:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:10:05,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 08:10:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:05,363 INFO L225 Difference]: With dead ends: 797 [2019-12-27 08:10:05,363 INFO L226 Difference]: Without dead ends: 535 [2019-12-27 08:10:05,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:10:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-27 08:10:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-27 08:10:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 08:10:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-27 08:10:05,376 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-27 08:10:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:05,377 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-27 08:10:05,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:10:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-27 08:10:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:05,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:05,379 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-27 08:10:05,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-27 08:10:05,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:05,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456021508] [2019-12-27 08:10:05,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456021508] [2019-12-27 08:10:05,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:05,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:10:05,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658070661] [2019-12-27 08:10:05,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:10:05,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:10:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:10:05,591 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 8 states. [2019-12-27 08:10:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:06,072 INFO L93 Difference]: Finished difference Result 705 states and 1447 transitions. [2019-12-27 08:10:06,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:10:06,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 08:10:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:06,078 INFO L225 Difference]: With dead ends: 705 [2019-12-27 08:10:06,078 INFO L226 Difference]: Without dead ends: 705 [2019-12-27 08:10:06,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:10:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-27 08:10:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-12-27 08:10:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-27 08:10:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1226 transitions. [2019-12-27 08:10:06,102 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1226 transitions. Word has length 41 [2019-12-27 08:10:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:06,102 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1226 transitions. [2019-12-27 08:10:06,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:10:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1226 transitions. [2019-12-27 08:10:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:06,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:06,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:06,104 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 670576248, now seen corresponding path program 1 times [2019-12-27 08:10:06,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:06,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666897137] [2019-12-27 08:10:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:06,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666897137] [2019-12-27 08:10:06,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:06,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:06,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624519223] [2019-12-27 08:10:06,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:06,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:06,164 INFO L87 Difference]: Start difference. First operand 582 states and 1226 transitions. Second operand 3 states. [2019-12-27 08:10:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:06,200 INFO L93 Difference]: Finished difference Result 653 states and 1281 transitions. [2019-12-27 08:10:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:06,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:06,204 INFO L225 Difference]: With dead ends: 653 [2019-12-27 08:10:06,204 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 08:10:06,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 08:10:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 575. [2019-12-27 08:10:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 08:10:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1142 transitions. [2019-12-27 08:10:06,219 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1142 transitions. Word has length 41 [2019-12-27 08:10:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:06,220 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1142 transitions. [2019-12-27 08:10:06,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1142 transitions. [2019-12-27 08:10:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:06,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:06,223 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-27 08:10:06,223 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-27 08:10:06,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:06,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985840959] [2019-12-27 08:10:06,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:06,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985840959] [2019-12-27 08:10:06,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:06,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:10:06,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645538029] [2019-12-27 08:10:06,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:10:06,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:10:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:10:06,370 INFO L87 Difference]: Start difference. First operand 575 states and 1142 transitions. Second operand 9 states. [2019-12-27 08:10:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:07,169 INFO L93 Difference]: Finished difference Result 1278 states and 2500 transitions. [2019-12-27 08:10:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:10:07,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 08:10:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:07,176 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 08:10:07,176 INFO L226 Difference]: Without dead ends: 1042 [2019-12-27 08:10:07,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:10:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-27 08:10:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 575. [2019-12-27 08:10:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 08:10:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1135 transitions. [2019-12-27 08:10:07,193 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1135 transitions. Word has length 41 [2019-12-27 08:10:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:07,194 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1135 transitions. [2019-12-27 08:10:07,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:10:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1135 transitions. [2019-12-27 08:10:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:07,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:07,196 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-27 08:10:07,196 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-27 08:10:07,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:07,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108085961] [2019-12-27 08:10:07,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:07,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108085961] [2019-12-27 08:10:07,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:07,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:10:07,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289673770] [2019-12-27 08:10:07,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:10:07,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:10:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:10:07,302 INFO L87 Difference]: Start difference. First operand 575 states and 1135 transitions. Second operand 6 states. [2019-12-27 08:10:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:07,738 INFO L93 Difference]: Finished difference Result 822 states and 1604 transitions. [2019-12-27 08:10:07,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:10:07,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 08:10:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:07,745 INFO L225 Difference]: With dead ends: 822 [2019-12-27 08:10:07,745 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 08:10:07,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-27 08:10:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 08:10:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 599. [2019-12-27 08:10:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 08:10:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1188 transitions. [2019-12-27 08:10:07,759 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1188 transitions. Word has length 41 [2019-12-27 08:10:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:07,759 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1188 transitions. [2019-12-27 08:10:07,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:10:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1188 transitions. [2019-12-27 08:10:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:07,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:07,761 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-27 08:10:07,761 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-27 08:10:07,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:07,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857018382] [2019-12-27 08:10:07,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:07,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857018382] [2019-12-27 08:10:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:07,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366459962] [2019-12-27 08:10:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:07,837 INFO L87 Difference]: Start difference. First operand 599 states and 1188 transitions. Second operand 3 states. [2019-12-27 08:10:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:07,861 INFO L93 Difference]: Finished difference Result 599 states and 1186 transitions. [2019-12-27 08:10:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:07,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:07,865 INFO L225 Difference]: With dead ends: 599 [2019-12-27 08:10:07,865 INFO L226 Difference]: Without dead ends: 599 [2019-12-27 08:10:07,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-27 08:10:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 507. [2019-12-27 08:10:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 08:10:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1013 transitions. [2019-12-27 08:10:07,876 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1013 transitions. Word has length 41 [2019-12-27 08:10:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1013 transitions. [2019-12-27 08:10:07,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1013 transitions. [2019-12-27 08:10:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:10:07,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:07,878 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-27 08:10:07,878 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-27 08:10:07,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:07,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830997578] [2019-12-27 08:10:07,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:10:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:10:07,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:10:07,963 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:10:07,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= |v_ULTIMATE.start_main_~#t2561~0.offset_16| 0) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2561~0.base_20| 4)) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_20|) 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_20| 1)) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_20|) |v_ULTIMATE.start_main_~#t2561~0.offset_16| 0))) (= 0 v_~__unbuffered_cnt~0_16) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2561~0.base_20|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_21|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ULTIMATE.start_main_~#t2561~0.offset=|v_ULTIMATE.start_main_~#t2561~0.offset_16|, #length=|v_#length_15|, ~y~0=v_~y~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2561~0.base=|v_ULTIMATE.start_main_~#t2561~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2561~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2561~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:10:07,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2562~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2562~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2562~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11|) |v_ULTIMATE.start_main_~#t2562~0.offset_9| 1)) |v_#memory_int_5|) (= 0 |v_ULTIMATE.start_main_~#t2562~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_11|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 08:10:07,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 08:10:07,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-582825396 256) 0))) (or (and (= ~x$w_buff0~0_In-582825396 |P0Thread1of1ForFork1_#t~ite8_Out-582825396|) .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out-582825396| |P0Thread1of1ForFork1_#t~ite9_Out-582825396|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-582825396 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-582825396 256) 0) (and (= (mod ~x$w_buff1_used~0_In-582825396 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-582825396 256)))))) (and (= |P0Thread1of1ForFork1_#t~ite8_In-582825396| |P0Thread1of1ForFork1_#t~ite8_Out-582825396|) (not .cse0) (= ~x$w_buff0~0_In-582825396 |P0Thread1of1ForFork1_#t~ite9_Out-582825396|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-582825396, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-582825396, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-582825396|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582825396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-582825396, ~weak$$choice2~0=~weak$$choice2~0_In-582825396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582825396} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-582825396, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-582825396, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-582825396|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-582825396|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582825396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-582825396, ~weak$$choice2~0=~weak$$choice2~0_In-582825396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582825396} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 08:10:07,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 08:10:07,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 08:10:07,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1520243903 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1520243903 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1520243903| ~x$w_buff0_used~0_In-1520243903)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1520243903|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1520243903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1520243903} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1520243903, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1520243903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1520243903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 08:10:07,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-630927383 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-630927383 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-630927383 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-630927383 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-630927383| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-630927383| ~x$w_buff1_used~0_In-630927383) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-630927383, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-630927383, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-630927383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-630927383} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-630927383, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-630927383, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-630927383, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-630927383|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-630927383} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 08:10:07,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-142606812 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-142606812 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-142606812) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-142606812 ~x$r_buff0_thd2~0_Out-142606812) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-142606812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142606812} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-142606812|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-142606812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142606812} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:10:07,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In34686156 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In34686156 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In34686156 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In34686156 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out34686156| ~x$r_buff1_thd2~0_In34686156) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out34686156| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In34686156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In34686156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In34686156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In34686156} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out34686156|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In34686156, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In34686156, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In34686156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In34686156} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 08:10:07,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |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{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__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[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 08:10:07,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:10:07,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-870339811 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite34_Out-870339811| |ULTIMATE.start_main_#t~ite35_Out-870339811|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-870339811 256) 0))) (or (and (= ~x~0_In-870339811 |ULTIMATE.start_main_#t~ite34_Out-870339811|) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite34_Out-870339811| ~x$w_buff1~0_In-870339811) (not .cse0) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-870339811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-870339811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-870339811, ~x~0=~x~0_In-870339811} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-870339811, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-870339811|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-870339811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-870339811, ~x~0=~x~0_In-870339811, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-870339811|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 08:10:07,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2050241414 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2050241414 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out2050241414| ~x$w_buff0_used~0_In2050241414)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out2050241414| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050241414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050241414} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2050241414, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2050241414|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050241414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 08:10:07,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1237769293 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1237769293 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1237769293 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1237769293 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-1237769293| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite37_Out-1237769293| ~x$w_buff1_used~0_In-1237769293) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1237769293, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1237769293, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1237769293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237769293} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1237769293, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1237769293, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1237769293|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1237769293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237769293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:10:07,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In305049085 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In305049085 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out305049085| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out305049085| ~x$r_buff0_thd0~0_In305049085) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In305049085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In305049085} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In305049085, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out305049085|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In305049085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 08:10:07,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1996370718 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1996370718 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1996370718 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1996370718 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1996370718| ~x$r_buff1_thd0~0_In-1996370718) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1996370718| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1996370718, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1996370718, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1996370718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1996370718} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1996370718, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1996370718|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1996370718, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1996370718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1996370718} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 08:10:07,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:10:08,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:10:08 BasicIcfg [2019-12-27 08:10:08,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:10:08,046 INFO L168 Benchmark]: Toolchain (without parser) took 11146.17 ms. Allocated memory was 136.8 MB in the beginning and 358.1 MB in the end (delta: 221.2 MB). Free memory was 99.9 MB in the beginning and 76.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,047 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.90 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 200.8 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,049 INFO L168 Benchmark]: Boogie Preprocessor took 35.29 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,050 INFO L168 Benchmark]: RCFGBuilder took 731.88 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 110.5 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,050 INFO L168 Benchmark]: TraceAbstraction took 9555.49 ms. Allocated memory was 200.8 MB in the beginning and 358.1 MB in the end (delta: 157.3 MB). Free memory was 109.8 MB in the beginning and 76.1 MB in the end (delta: 33.7 MB). Peak memory consumption was 191.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:08,055 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.15 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.90 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 200.8 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.29 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 731.88 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 110.5 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9555.49 ms. Allocated memory was 200.8 MB in the beginning and 358.1 MB in the end (delta: 157.3 MB). Free memory was 109.8 MB in the beginning and 76.1 MB in the end (delta: 33.7 MB). Peak memory consumption was 191.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1356 SDtfs, 1432 SDslu, 2310 SDs, 0 SdLazy, 1465 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2118 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 38968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...