/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:57:45,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:57:45,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:57:45,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:57:45,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:57:45,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:57:45,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:57:45,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:57:45,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:57:45,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:57:45,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:57:45,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:57:45,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:57:45,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:57:45,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:57:45,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:57:45,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:57:45,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:57:45,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:57:45,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:57:45,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:57:45,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:57:45,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:57:45,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:57:45,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:57:45,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:57:45,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:57:45,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:57:45,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:57:45,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:57:45,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:57:45,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:57:45,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:57:45,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:57:45,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:57:45,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:57:45,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:57:45,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:57:45,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:57:45,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:57:45,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:57:45,706 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-SemanticLbe.epf [2019-12-18 16:57:45,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:57:45,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:57:45,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:57:45,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:57:45,721 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:57:45,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:57:45,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:57:45,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:57:45,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:57:45,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:57:45,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:57:45,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:57:45,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:57:45,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:57:45,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:57:45,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:57:45,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:57:45,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:57:45,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:57:45,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:57:45,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:57:45,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:57:45,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:57:45,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:57:45,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:57:45,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:57:45,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:57:45,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:57:45,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:57:46,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:57:46,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:57:46,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:57:46,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:57:46,081 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:57:46,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 16:57:46,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd6a36ad/171ab134fc464d2f9a9b0f483aa5b909/FLAG5a9de9482 [2019-12-18 16:57:46,675 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:57:46,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 16:57:46,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd6a36ad/171ab134fc464d2f9a9b0f483aa5b909/FLAG5a9de9482 [2019-12-18 16:57:46,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd6a36ad/171ab134fc464d2f9a9b0f483aa5b909 [2019-12-18 16:57:46,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:57:46,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:57:46,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:57:46,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:57:46,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:57:46,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:57:46" (1/1) ... [2019-12-18 16:57:46,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c29ffc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:46, skipping insertion in model container [2019-12-18 16:57:46,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:57:46" (1/1) ... [2019-12-18 16:57:46,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:57:47,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:57:47,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:57:47,688 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:57:47,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:57:47,837 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:57:47,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47 WrapperNode [2019-12-18 16:57:47,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:57:47,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:57:47,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:57:47,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:57:47,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:57:47,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:57:47,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:57:47,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:57:47,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... [2019-12-18 16:57:47,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:57:47,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:57:47,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:57:47,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:57:47,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:57:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:57:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:57:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:57:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:57:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:57:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:57:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:57:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:57:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:57:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:57:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:57:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:57:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:57:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:57:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:57:48,006 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:57:48,711 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:57:48,711 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:57:48,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:57:48 BoogieIcfgContainer [2019-12-18 16:57:48,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:57:48,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:57:48,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:57:48,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:57:48,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:57:46" (1/3) ... [2019-12-18 16:57:48,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d476810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:57:48, skipping insertion in model container [2019-12-18 16:57:48,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:57:47" (2/3) ... [2019-12-18 16:57:48,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d476810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:57:48, skipping insertion in model container [2019-12-18 16:57:48,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:57:48" (3/3) ... [2019-12-18 16:57:48,722 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-18 16:57:48,732 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:57:48,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:57:48,745 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:57:48,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:57:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,853 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,853 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,853 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,854 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,869 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,870 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,890 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:57:48,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:57:48,930 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:57:48,930 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:57:48,930 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:57:48,930 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:57:48,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:57:48,931 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:57:48,931 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:57:48,931 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:57:48,953 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 16:57:48,955 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 16:57:49,043 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 16:57:49,044 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:57:49,063 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:57:49,090 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 16:57:49,144 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 16:57:49,151 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:57:49,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:57:49,191 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:57:49,192 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:57:54,321 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:57:54,832 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 16:57:54,964 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 16:57:55,000 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-18 16:57:55,000 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 16:57:55,004 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 16:58:34,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-18 16:58:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-18 16:58:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:58:34,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:58:34,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:58:34,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:58:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:58:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-18 16:58:34,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:58:34,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618434531] [2019-12-18 16:58:34,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:58:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:58:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:58:34,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618434531] [2019-12-18 16:58:34,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:58:34,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:58:34,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611396913] [2019-12-18 16:58:34,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:58:34,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:58:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:58:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:58:34,436 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-18 16:58:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:58:36,448 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-18 16:58:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:58:36,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:58:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:58:42,674 INFO L225 Difference]: With dead ends: 169554 [2019-12-18 16:58:42,675 INFO L226 Difference]: Without dead ends: 159076 [2019-12-18 16:58:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:58:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-18 16:58:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-18 16:58:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-18 16:58:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-18 16:58:55,780 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-18 16:58:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:58:55,781 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-18 16:58:55,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:58:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-18 16:58:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:58:55,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:58:55,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:58:55,794 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:58:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:58:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-18 16:58:55,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:58:55,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394644805] [2019-12-18 16:58:55,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:58:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:58:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:58:55,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394644805] [2019-12-18 16:58:55,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:58:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:58:55,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895800565] [2019-12-18 16:58:55,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:58:55,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:58:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:58:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:58:55,918 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-18 16:59:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:59:03,949 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-18 16:59:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:59:03,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:59:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:59:05,559 INFO L225 Difference]: With dead ends: 251868 [2019-12-18 16:59:05,559 INFO L226 Difference]: Without dead ends: 251658 [2019-12-18 16:59:05,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:59:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-18 16:59:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-18 16:59:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-18 16:59:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-18 16:59:33,131 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-18 16:59:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:59:33,131 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-18 16:59:33,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:59:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-18 16:59:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:59:33,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:59:33,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:59:33,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:59:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:59:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-18 16:59:33,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:59:33,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232411802] [2019-12-18 16:59:33,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:59:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:59:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:59:33,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232411802] [2019-12-18 16:59:33,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:59:33,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:59:33,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98945183] [2019-12-18 16:59:33,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:59:33,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:59:33,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:59:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:59:33,200 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-18 16:59:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:59:33,973 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-18 16:59:33,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:59:33,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:59:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:59:36,383 INFO L225 Difference]: With dead ends: 146539 [2019-12-18 16:59:36,384 INFO L226 Difference]: Without dead ends: 146539 [2019-12-18 16:59:36,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:59:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-18 16:59:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-18 16:59:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-18 16:59:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-18 16:59:51,310 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-18 16:59:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:59:51,310 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-18 16:59:51,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:59:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-18 16:59:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:59:51,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:59:51,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:59:51,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:59:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:59:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-18 16:59:51,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:59:51,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542973575] [2019-12-18 16:59:51,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:59:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:59:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:59:51,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542973575] [2019-12-18 16:59:51,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:59:51,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:59:51,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577314153] [2019-12-18 16:59:51,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:59:51,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:59:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:59:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:59:51,411 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-18 16:59:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:59:51,606 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-18 16:59:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:59:51,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:59:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:59:51,683 INFO L225 Difference]: With dead ends: 40251 [2019-12-18 16:59:51,683 INFO L226 Difference]: Without dead ends: 40251 [2019-12-18 16:59:51,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:59:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-18 16:59:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-18 16:59:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-18 16:59:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-18 16:59:57,123 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-18 16:59:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:59:57,123 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-18 16:59:57,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:59:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-18 16:59:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:59:57,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:59:57,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:59:57,126 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:59:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:59:57,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-18 16:59:57,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:59:57,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89309828] [2019-12-18 16:59:57,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:59:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:59:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:59:57,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89309828] [2019-12-18 16:59:57,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:59:57,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:59:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717805294] [2019-12-18 16:59:57,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:59:57,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:59:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:59:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:59:57,241 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-18 16:59:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:59:57,782 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-18 16:59:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:59:57,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:59:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:59:57,902 INFO L225 Difference]: With dead ends: 58215 [2019-12-18 16:59:57,903 INFO L226 Difference]: Without dead ends: 58197 [2019-12-18 16:59:57,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:59:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-18 16:59:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-18 16:59:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-18 16:59:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-18 16:59:59,270 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-18 16:59:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:59:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-18 16:59:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:59:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-18 16:59:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:59:59,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:59:59,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:59:59,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:59:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:59:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-18 16:59:59,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:59:59,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793098746] [2019-12-18 16:59:59,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:59:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:59:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:59:59,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793098746] [2019-12-18 16:59:59,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:59:59,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:59:59,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987420505] [2019-12-18 16:59:59,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:59:59,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:59:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:59:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:59:59,396 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-18 17:00:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:00,318 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-18 17:00:00,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:00:00,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 17:00:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:00,469 INFO L225 Difference]: With dead ends: 73096 [2019-12-18 17:00:00,470 INFO L226 Difference]: Without dead ends: 73066 [2019-12-18 17:00:00,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:00:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-18 17:00:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-18 17:00:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-18 17:00:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-18 17:00:02,128 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-18 17:00:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:02,129 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-18 17:00:02,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:00:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-18 17:00:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:00:02,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:02,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:02,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-18 17:00:02,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:02,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595228448] [2019-12-18 17:00:02,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:02,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595228448] [2019-12-18 17:00:02,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:02,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:00:02,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027809457] [2019-12-18 17:00:02,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:00:02,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:00:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:00:02,245 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-18 17:00:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:03,210 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-18 17:00:03,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:00:03,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 17:00:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:03,357 INFO L225 Difference]: With dead ends: 73479 [2019-12-18 17:00:03,358 INFO L226 Difference]: Without dead ends: 73449 [2019-12-18 17:00:03,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:00:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-18 17:00:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-18 17:00:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-18 17:00:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-18 17:00:04,931 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-18 17:00:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:04,932 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-18 17:00:04,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:00:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-18 17:00:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:00:04,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:04,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:04,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-18 17:00:04,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:04,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567093447] [2019-12-18 17:00:04,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:05,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567093447] [2019-12-18 17:00:05,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:05,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:00:05,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178148057] [2019-12-18 17:00:05,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:00:05,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:00:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:00:05,035 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-18 17:00:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:05,247 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-18 17:00:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:00:05,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:00:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:05,344 INFO L225 Difference]: With dead ends: 26235 [2019-12-18 17:00:05,345 INFO L226 Difference]: Without dead ends: 26235 [2019-12-18 17:00:05,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:00:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-18 17:00:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-18 17:00:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 17:00:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-18 17:00:06,320 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-18 17:00:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:06,320 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-18 17:00:06,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:00:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-18 17:00:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:00:06,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:06,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:06,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:06,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-18 17:00:06,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:06,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876770826] [2019-12-18 17:00:06,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:06,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876770826] [2019-12-18 17:00:06,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:06,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:00:06,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851158976] [2019-12-18 17:00:06,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:00:06,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:00:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:00:06,457 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 4 states. [2019-12-18 17:00:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:06,641 INFO L93 Difference]: Finished difference Result 37412 states and 127885 transitions. [2019-12-18 17:00:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:00:06,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:00:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:06,694 INFO L225 Difference]: With dead ends: 37412 [2019-12-18 17:00:06,694 INFO L226 Difference]: Without dead ends: 26234 [2019-12-18 17:00:06,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:00:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26234 states. [2019-12-18 17:00:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26234 to 26084. [2019-12-18 17:00:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26084 states. [2019-12-18 17:00:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26084 states to 26084 states and 92286 transitions. [2019-12-18 17:00:07,172 INFO L78 Accepts]: Start accepts. Automaton has 26084 states and 92286 transitions. Word has length 42 [2019-12-18 17:00:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:07,173 INFO L462 AbstractCegarLoop]: Abstraction has 26084 states and 92286 transitions. [2019-12-18 17:00:07,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:00:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26084 states and 92286 transitions. [2019-12-18 17:00:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:00:07,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:07,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:07,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-18 17:00:07,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:07,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016652989] [2019-12-18 17:00:07,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:07,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016652989] [2019-12-18 17:00:07,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:07,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:00:07,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138141289] [2019-12-18 17:00:07,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:07,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:07,278 INFO L87 Difference]: Start difference. First operand 26084 states and 92286 transitions. Second operand 3 states. [2019-12-18 17:00:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:07,494 INFO L93 Difference]: Finished difference Result 39452 states and 132645 transitions. [2019-12-18 17:00:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:07,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 17:00:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:07,578 INFO L225 Difference]: With dead ends: 39452 [2019-12-18 17:00:07,578 INFO L226 Difference]: Without dead ends: 26924 [2019-12-18 17:00:07,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-18 17:00:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 25835. [2019-12-18 17:00:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 17:00:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 79997 transitions. [2019-12-18 17:00:08,502 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 79997 transitions. Word has length 42 [2019-12-18 17:00:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:08,503 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 79997 transitions. [2019-12-18 17:00:08,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 79997 transitions. [2019-12-18 17:00:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 17:00:08,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:08,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:08,541 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-18 17:00:08,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:08,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202402075] [2019-12-18 17:00:08,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:08,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202402075] [2019-12-18 17:00:08,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:08,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:00:08,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737479045] [2019-12-18 17:00:08,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:00:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:00:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:00:08,622 INFO L87 Difference]: Start difference. First operand 25835 states and 79997 transitions. Second operand 6 states. [2019-12-18 17:00:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:08,747 INFO L93 Difference]: Finished difference Result 24507 states and 76659 transitions. [2019-12-18 17:00:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:00:08,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 17:00:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:08,765 INFO L225 Difference]: With dead ends: 24507 [2019-12-18 17:00:08,766 INFO L226 Difference]: Without dead ends: 10719 [2019-12-18 17:00:08,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:00:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10719 states. [2019-12-18 17:00:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10719 to 10341. [2019-12-18 17:00:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-12-18 17:00:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 32248 transitions. [2019-12-18 17:00:08,935 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 32248 transitions. Word has length 43 [2019-12-18 17:00:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:08,935 INFO L462 AbstractCegarLoop]: Abstraction has 10341 states and 32248 transitions. [2019-12-18 17:00:08,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:00:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 32248 transitions. [2019-12-18 17:00:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:08,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:08,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:08,951 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash -360004126, now seen corresponding path program 1 times [2019-12-18 17:00:08,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:08,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201049335] [2019-12-18 17:00:08,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:09,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201049335] [2019-12-18 17:00:09,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:00:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370024202] [2019-12-18 17:00:09,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:09,043 INFO L87 Difference]: Start difference. First operand 10341 states and 32248 transitions. Second operand 3 states. [2019-12-18 17:00:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:09,123 INFO L93 Difference]: Finished difference Result 13894 states and 42635 transitions. [2019-12-18 17:00:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:09,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:00:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:09,142 INFO L225 Difference]: With dead ends: 13894 [2019-12-18 17:00:09,143 INFO L226 Difference]: Without dead ends: 13894 [2019-12-18 17:00:09,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-12-18 17:00:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 11246. [2019-12-18 17:00:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-12-18 17:00:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35029 transitions. [2019-12-18 17:00:09,332 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 35029 transitions. Word has length 57 [2019-12-18 17:00:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:09,332 INFO L462 AbstractCegarLoop]: Abstraction has 11246 states and 35029 transitions. [2019-12-18 17:00:09,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 35029 transitions. [2019-12-18 17:00:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:09,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:09,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:09,345 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-18 17:00:09,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:09,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370643123] [2019-12-18 17:00:09,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:09,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370643123] [2019-12-18 17:00:09,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:09,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:00:09,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160325119] [2019-12-18 17:00:09,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:00:09,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:00:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:00:09,443 INFO L87 Difference]: Start difference. First operand 11246 states and 35029 transitions. Second operand 7 states. [2019-12-18 17:00:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:09,910 INFO L93 Difference]: Finished difference Result 31203 states and 96822 transitions. [2019-12-18 17:00:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:00:09,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:00:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:09,957 INFO L225 Difference]: With dead ends: 31203 [2019-12-18 17:00:09,957 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 17:00:09,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:00:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 17:00:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 14347. [2019-12-18 17:00:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-18 17:00:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 45043 transitions. [2019-12-18 17:00:10,278 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 45043 transitions. Word has length 57 [2019-12-18 17:00:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:10,279 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 45043 transitions. [2019-12-18 17:00:10,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:00:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 45043 transitions. [2019-12-18 17:00:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:10,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:10,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:10,294 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-18 17:00:10,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:10,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109426389] [2019-12-18 17:00:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109426389] [2019-12-18 17:00:10,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:10,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:00:10,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575020949] [2019-12-18 17:00:10,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:00:10,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:00:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:00:10,372 INFO L87 Difference]: Start difference. First operand 14347 states and 45043 transitions. Second operand 6 states. [2019-12-18 17:00:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:10,844 INFO L93 Difference]: Finished difference Result 36806 states and 112743 transitions. [2019-12-18 17:00:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:00:10,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 17:00:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:10,898 INFO L225 Difference]: With dead ends: 36806 [2019-12-18 17:00:10,898 INFO L226 Difference]: Without dead ends: 26675 [2019-12-18 17:00:10,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:00:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2019-12-18 17:00:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 16874. [2019-12-18 17:00:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16874 states. [2019-12-18 17:00:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16874 states to 16874 states and 52931 transitions. [2019-12-18 17:00:11,272 INFO L78 Accepts]: Start accepts. Automaton has 16874 states and 52931 transitions. Word has length 57 [2019-12-18 17:00:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:11,272 INFO L462 AbstractCegarLoop]: Abstraction has 16874 states and 52931 transitions. [2019-12-18 17:00:11,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:00:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 16874 states and 52931 transitions. [2019-12-18 17:00:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:11,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:11,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:11,292 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-18 17:00:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:11,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32709549] [2019-12-18 17:00:11,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:11,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32709549] [2019-12-18 17:00:11,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:11,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:00:11,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066601724] [2019-12-18 17:00:11,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:00:11,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:00:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:00:11,378 INFO L87 Difference]: Start difference. First operand 16874 states and 52931 transitions. Second operand 7 states. [2019-12-18 17:00:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:11,783 INFO L93 Difference]: Finished difference Result 29867 states and 90934 transitions. [2019-12-18 17:00:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:00:11,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:00:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:11,825 INFO L225 Difference]: With dead ends: 29867 [2019-12-18 17:00:11,825 INFO L226 Difference]: Without dead ends: 27808 [2019-12-18 17:00:11,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:00:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27808 states. [2019-12-18 17:00:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27808 to 16938. [2019-12-18 17:00:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 17:00:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 53162 transitions. [2019-12-18 17:00:12,176 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 53162 transitions. Word has length 57 [2019-12-18 17:00:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:12,177 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 53162 transitions. [2019-12-18 17:00:12,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:00:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 53162 transitions. [2019-12-18 17:00:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:12,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:12,196 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143536, now seen corresponding path program 1 times [2019-12-18 17:00:12,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067310857] [2019-12-18 17:00:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:12,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067310857] [2019-12-18 17:00:12,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:12,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:00:12,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935945299] [2019-12-18 17:00:12,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:12,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:12,251 INFO L87 Difference]: Start difference. First operand 16938 states and 53162 transitions. Second operand 3 states. [2019-12-18 17:00:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:12,356 INFO L93 Difference]: Finished difference Result 18741 states and 57074 transitions. [2019-12-18 17:00:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:12,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:00:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:12,390 INFO L225 Difference]: With dead ends: 18741 [2019-12-18 17:00:12,390 INFO L226 Difference]: Without dead ends: 18741 [2019-12-18 17:00:12,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-18 17:00:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 16938. [2019-12-18 17:00:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 17:00:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51972 transitions. [2019-12-18 17:00:12,677 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51972 transitions. Word has length 57 [2019-12-18 17:00:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:12,821 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51972 transitions. [2019-12-18 17:00:12,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51972 transitions. [2019-12-18 17:00:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:12,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:12,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:12,840 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-18 17:00:12,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:12,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167712705] [2019-12-18 17:00:12,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:12,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167712705] [2019-12-18 17:00:12,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:12,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:00:12,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743128527] [2019-12-18 17:00:12,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:00:12,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:00:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:00:12,912 INFO L87 Difference]: Start difference. First operand 16938 states and 51972 transitions. Second operand 7 states. [2019-12-18 17:00:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:13,279 INFO L93 Difference]: Finished difference Result 33067 states and 98644 transitions. [2019-12-18 17:00:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:00:13,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:00:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:13,318 INFO L225 Difference]: With dead ends: 33067 [2019-12-18 17:00:13,319 INFO L226 Difference]: Without dead ends: 27923 [2019-12-18 17:00:13,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:00:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27923 states. [2019-12-18 17:00:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27923 to 17148. [2019-12-18 17:00:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-18 17:00:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 52559 transitions. [2019-12-18 17:00:13,670 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 52559 transitions. Word has length 57 [2019-12-18 17:00:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:13,670 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 52559 transitions. [2019-12-18 17:00:13,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:00:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 52559 transitions. [2019-12-18 17:00:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:13,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:13,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:13,689 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-18 17:00:13,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:13,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667589331] [2019-12-18 17:00:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:13,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667589331] [2019-12-18 17:00:13,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:13,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:00:13,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027829312] [2019-12-18 17:00:13,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:00:13,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:00:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:00:13,784 INFO L87 Difference]: Start difference. First operand 17148 states and 52559 transitions. Second operand 5 states. [2019-12-18 17:00:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:14,285 INFO L93 Difference]: Finished difference Result 26314 states and 78268 transitions. [2019-12-18 17:00:14,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:00:14,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 17:00:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:14,322 INFO L225 Difference]: With dead ends: 26314 [2019-12-18 17:00:14,322 INFO L226 Difference]: Without dead ends: 26188 [2019-12-18 17:00:14,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:00:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26188 states. [2019-12-18 17:00:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26188 to 20073. [2019-12-18 17:00:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20073 states. [2019-12-18 17:00:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 61009 transitions. [2019-12-18 17:00:14,673 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 61009 transitions. Word has length 57 [2019-12-18 17:00:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:14,673 INFO L462 AbstractCegarLoop]: Abstraction has 20073 states and 61009 transitions. [2019-12-18 17:00:14,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:00:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 61009 transitions. [2019-12-18 17:00:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:14,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:14,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:14,695 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-18 17:00:14,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:14,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673565790] [2019-12-18 17:00:14,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:14,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673565790] [2019-12-18 17:00:14,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:14,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:00:14,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641937935] [2019-12-18 17:00:14,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:00:14,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:00:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:00:14,870 INFO L87 Difference]: Start difference. First operand 20073 states and 61009 transitions. Second operand 8 states. [2019-12-18 17:00:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:16,086 INFO L93 Difference]: Finished difference Result 27381 states and 81339 transitions. [2019-12-18 17:00:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:00:16,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 17:00:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:16,134 INFO L225 Difference]: With dead ends: 27381 [2019-12-18 17:00:16,134 INFO L226 Difference]: Without dead ends: 27381 [2019-12-18 17:00:16,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:00:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-18 17:00:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 20271. [2019-12-18 17:00:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20271 states. [2019-12-18 17:00:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 61591 transitions. [2019-12-18 17:00:16,491 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 61591 transitions. Word has length 57 [2019-12-18 17:00:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:16,492 INFO L462 AbstractCegarLoop]: Abstraction has 20271 states and 61591 transitions. [2019-12-18 17:00:16,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:00:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 61591 transitions. [2019-12-18 17:00:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:16,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:16,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:16,517 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-18 17:00:16,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:16,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671273700] [2019-12-18 17:00:16,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:16,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671273700] [2019-12-18 17:00:16,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:16,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:00:16,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252174433] [2019-12-18 17:00:16,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:00:16,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:16,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:00:16,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:00:16,665 INFO L87 Difference]: Start difference. First operand 20271 states and 61591 transitions. Second operand 9 states. [2019-12-18 17:00:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:17,897 INFO L93 Difference]: Finished difference Result 29033 states and 85853 transitions. [2019-12-18 17:00:17,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:00:17,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:00:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:17,938 INFO L225 Difference]: With dead ends: 29033 [2019-12-18 17:00:17,938 INFO L226 Difference]: Without dead ends: 29033 [2019-12-18 17:00:17,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:00:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29033 states. [2019-12-18 17:00:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29033 to 23020. [2019-12-18 17:00:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-18 17:00:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 69387 transitions. [2019-12-18 17:00:18,360 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 69387 transitions. Word has length 57 [2019-12-18 17:00:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:18,361 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 69387 transitions. [2019-12-18 17:00:18,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:00:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 69387 transitions. [2019-12-18 17:00:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:18,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:18,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:18,388 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-18 17:00:18,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:18,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916562813] [2019-12-18 17:00:18,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:18,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916562813] [2019-12-18 17:00:18,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:18,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:00:18,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402860871] [2019-12-18 17:00:18,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:00:18,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:18,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:00:18,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:00:18,546 INFO L87 Difference]: Start difference. First operand 23020 states and 69387 transitions. Second operand 9 states. [2019-12-18 17:00:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:20,320 INFO L93 Difference]: Finished difference Result 35444 states and 103738 transitions. [2019-12-18 17:00:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:00:20,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:00:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:20,404 INFO L225 Difference]: With dead ends: 35444 [2019-12-18 17:00:20,405 INFO L226 Difference]: Without dead ends: 35156 [2019-12-18 17:00:20,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:00:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35156 states. [2019-12-18 17:00:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35156 to 25598. [2019-12-18 17:00:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25598 states. [2019-12-18 17:00:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25598 states to 25598 states and 76158 transitions. [2019-12-18 17:00:21,222 INFO L78 Accepts]: Start accepts. Automaton has 25598 states and 76158 transitions. Word has length 57 [2019-12-18 17:00:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:21,223 INFO L462 AbstractCegarLoop]: Abstraction has 25598 states and 76158 transitions. [2019-12-18 17:00:21,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:00:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 25598 states and 76158 transitions. [2019-12-18 17:00:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:21,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:21,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:21,250 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-18 17:00:21,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:21,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336668528] [2019-12-18 17:00:21,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:21,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336668528] [2019-12-18 17:00:21,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:21,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:00:21,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83454539] [2019-12-18 17:00:21,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:00:21,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:00:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:00:21,419 INFO L87 Difference]: Start difference. First operand 25598 states and 76158 transitions. Second operand 10 states. [2019-12-18 17:00:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:23,349 INFO L93 Difference]: Finished difference Result 43300 states and 126781 transitions. [2019-12-18 17:00:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:00:23,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-18 17:00:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:23,410 INFO L225 Difference]: With dead ends: 43300 [2019-12-18 17:00:23,410 INFO L226 Difference]: Without dead ends: 43111 [2019-12-18 17:00:23,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:00:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-18 17:00:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 26559. [2019-12-18 17:00:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26559 states. [2019-12-18 17:00:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26559 states to 26559 states and 79086 transitions. [2019-12-18 17:00:24,183 INFO L78 Accepts]: Start accepts. Automaton has 26559 states and 79086 transitions. Word has length 57 [2019-12-18 17:00:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:24,184 INFO L462 AbstractCegarLoop]: Abstraction has 26559 states and 79086 transitions. [2019-12-18 17:00:24,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:00:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26559 states and 79086 transitions. [2019-12-18 17:00:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:24,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:24,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:24,214 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-18 17:00:24,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:24,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985479160] [2019-12-18 17:00:24,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:24,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985479160] [2019-12-18 17:00:24,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:24,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:00:24,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042215023] [2019-12-18 17:00:24,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:00:24,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:00:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:00:24,406 INFO L87 Difference]: Start difference. First operand 26559 states and 79086 transitions. Second operand 11 states. [2019-12-18 17:00:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:26,588 INFO L93 Difference]: Finished difference Result 38601 states and 112893 transitions. [2019-12-18 17:00:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:00:26,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-18 17:00:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:26,641 INFO L225 Difference]: With dead ends: 38601 [2019-12-18 17:00:26,641 INFO L226 Difference]: Without dead ends: 38421 [2019-12-18 17:00:26,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:00:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38421 states. [2019-12-18 17:00:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38421 to 26752. [2019-12-18 17:00:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26752 states. [2019-12-18 17:00:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26752 states to 26752 states and 79647 transitions. [2019-12-18 17:00:27,186 INFO L78 Accepts]: Start accepts. Automaton has 26752 states and 79647 transitions. Word has length 57 [2019-12-18 17:00:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:27,186 INFO L462 AbstractCegarLoop]: Abstraction has 26752 states and 79647 transitions. [2019-12-18 17:00:27,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:00:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26752 states and 79647 transitions. [2019-12-18 17:00:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:27,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:27,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:27,215 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2075339129, now seen corresponding path program 11 times [2019-12-18 17:00:27,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:27,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899119222] [2019-12-18 17:00:27,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:27,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899119222] [2019-12-18 17:00:27,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:27,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:00:27,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766575058] [2019-12-18 17:00:27,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:00:27,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:00:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:00:27,313 INFO L87 Difference]: Start difference. First operand 26752 states and 79647 transitions. Second operand 7 states. [2019-12-18 17:00:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:28,328 INFO L93 Difference]: Finished difference Result 38565 states and 112278 transitions. [2019-12-18 17:00:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:00:28,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:00:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:28,380 INFO L225 Difference]: With dead ends: 38565 [2019-12-18 17:00:28,380 INFO L226 Difference]: Without dead ends: 38565 [2019-12-18 17:00:28,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:00:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38565 states. [2019-12-18 17:00:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38565 to 26570. [2019-12-18 17:00:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26570 states. [2019-12-18 17:00:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26570 states to 26570 states and 79158 transitions. [2019-12-18 17:00:28,991 INFO L78 Accepts]: Start accepts. Automaton has 26570 states and 79158 transitions. Word has length 57 [2019-12-18 17:00:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:28,991 INFO L462 AbstractCegarLoop]: Abstraction has 26570 states and 79158 transitions. [2019-12-18 17:00:28,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:00:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26570 states and 79158 transitions. [2019-12-18 17:00:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:00:29,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:29,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:29,018 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 817096895, now seen corresponding path program 12 times [2019-12-18 17:00:29,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:29,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860322074] [2019-12-18 17:00:29,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:29,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860322074] [2019-12-18 17:00:29,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:00:29,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446363177] [2019-12-18 17:00:29,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:29,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:29,072 INFO L87 Difference]: Start difference. First operand 26570 states and 79158 transitions. Second operand 3 states. [2019-12-18 17:00:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:29,192 INFO L93 Difference]: Finished difference Result 26570 states and 79156 transitions. [2019-12-18 17:00:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:29,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:00:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:29,255 INFO L225 Difference]: With dead ends: 26570 [2019-12-18 17:00:29,255 INFO L226 Difference]: Without dead ends: 26570 [2019-12-18 17:00:29,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26570 states. [2019-12-18 17:00:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26570 to 21239. [2019-12-18 17:00:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21239 states. [2019-12-18 17:00:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21239 states to 21239 states and 64531 transitions. [2019-12-18 17:00:29,842 INFO L78 Accepts]: Start accepts. Automaton has 21239 states and 64531 transitions. Word has length 57 [2019-12-18 17:00:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:29,843 INFO L462 AbstractCegarLoop]: Abstraction has 21239 states and 64531 transitions. [2019-12-18 17:00:29,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 21239 states and 64531 transitions. [2019-12-18 17:00:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:00:29,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:29,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:29,877 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1231350538, now seen corresponding path program 1 times [2019-12-18 17:00:29,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:29,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583850017] [2019-12-18 17:00:29,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:29,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583850017] [2019-12-18 17:00:29,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:29,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:00:29,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744092465] [2019-12-18 17:00:29,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:29,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:29,945 INFO L87 Difference]: Start difference. First operand 21239 states and 64531 transitions. Second operand 3 states. [2019-12-18 17:00:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:30,009 INFO L93 Difference]: Finished difference Result 15754 states and 47156 transitions. [2019-12-18 17:00:30,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:30,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:00:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:30,030 INFO L225 Difference]: With dead ends: 15754 [2019-12-18 17:00:30,030 INFO L226 Difference]: Without dead ends: 15754 [2019-12-18 17:00:30,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-12-18 17:00:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15166. [2019-12-18 17:00:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15166 states. [2019-12-18 17:00:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15166 states to 15166 states and 45381 transitions. [2019-12-18 17:00:30,256 INFO L78 Accepts]: Start accepts. Automaton has 15166 states and 45381 transitions. Word has length 58 [2019-12-18 17:00:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:30,256 INFO L462 AbstractCegarLoop]: Abstraction has 15166 states and 45381 transitions. [2019-12-18 17:00:30,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15166 states and 45381 transitions. [2019-12-18 17:00:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:00:30,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:30,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:30,271 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-18 17:00:30,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:30,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093038632] [2019-12-18 17:00:30,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:00:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:00:30,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:00:30,395 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:00:30,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:00:30,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:00:30,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:00:30,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:00:30,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-18 17:00:30,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1716436397| |P3Thread1of1ForFork0_#t~ite33_Out1716436397|)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1716436397 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1716436397 256)))) (or (and .cse0 (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1716436397| ~y$w_buff1~0_In1716436397) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In1716436397 |P3Thread1of1ForFork0_#t~ite32_Out1716436397|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1716436397, ~y$w_buff1~0=~y$w_buff1~0_In1716436397, ~y~0=~y~0_In1716436397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716436397} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1716436397, ~y$w_buff1~0=~y$w_buff1~0_In1716436397, ~y~0=~y~0_In1716436397, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1716436397|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1716436397|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716436397} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 17:00:30,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:00:30,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-423469130 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-423469130 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-423469130| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-423469130| ~y$w_buff0_used~0_In-423469130) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-423469130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-423469130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-423469130|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 17:00:30,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1135745443 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1135745443 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1135745443 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1135745443 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out-1135745443| 0)) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork0_#t~ite35_Out-1135745443| ~y$w_buff1_used~0_In-1135745443) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1135745443, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1135745443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135745443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135745443} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1135745443, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1135745443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135745443, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1135745443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135745443} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 17:00:30,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In2041132750 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2041132750 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out2041132750| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out2041132750| ~y$r_buff0_thd4~0_In2041132750) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2041132750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041132750} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2041132750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041132750, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out2041132750|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 17:00:30,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In270736742 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In270736742 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In270736742 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In270736742 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out270736742| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd4~0_In270736742 |P3Thread1of1ForFork0_#t~ite37_Out270736742|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In270736742, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In270736742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In270736742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In270736742} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In270736742, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In270736742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In270736742, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out270736742|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In270736742} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 17:00:30,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:00:30,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-11670516 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-11670516| |P1Thread1of1ForFork2_#t~ite11_Out-11670516|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-11670516 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-11670516 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-11670516 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-11670516 256)))) .cse1 (= ~y$w_buff1~0_In-11670516 |P1Thread1of1ForFork2_#t~ite11_Out-11670516|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-11670516| ~y$w_buff1~0_In-11670516) (= |P1Thread1of1ForFork2_#t~ite11_In-11670516| |P1Thread1of1ForFork2_#t~ite11_Out-11670516|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-11670516, ~y$w_buff1~0=~y$w_buff1~0_In-11670516, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-11670516, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-11670516, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-11670516|, ~weak$$choice2~0=~weak$$choice2~0_In-11670516, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-11670516} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-11670516, ~y$w_buff1~0=~y$w_buff1~0_In-11670516, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-11670516, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-11670516, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-11670516|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-11670516|, ~weak$$choice2~0=~weak$$choice2~0_In-11670516, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-11670516} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:00:30,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1755618262 256)))) (or (and (= ~y$w_buff0_used~0_In-1755618262 |P1Thread1of1ForFork2_#t~ite14_Out-1755618262|) (= |P1Thread1of1ForFork2_#t~ite15_Out-1755618262| |P1Thread1of1ForFork2_#t~ite14_Out-1755618262|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1755618262 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1755618262 256))) (= (mod ~y$w_buff0_used~0_In-1755618262 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1755618262 256)))))) (and (not .cse0) (= ~y$w_buff0_used~0_In-1755618262 |P1Thread1of1ForFork2_#t~ite15_Out-1755618262|) (= |P1Thread1of1ForFork2_#t~ite14_In-1755618262| |P1Thread1of1ForFork2_#t~ite14_Out-1755618262|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755618262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755618262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1755618262, ~weak$$choice2~0=~weak$$choice2~0_In-1755618262, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1755618262|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755618262} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755618262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755618262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1755618262, ~weak$$choice2~0=~weak$$choice2~0_In-1755618262, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1755618262|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1755618262|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755618262} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 17:00:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:00:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-42593029 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-42593029| |P1Thread1of1ForFork2_#t~ite23_Out-42593029|) (= |P1Thread1of1ForFork2_#t~ite24_Out-42593029| ~y$r_buff1_thd2~0_In-42593029)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-42593029 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-42593029 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-42593029 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-42593029 256))))) .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-42593029| |P1Thread1of1ForFork2_#t~ite23_Out-42593029|) (= |P1Thread1of1ForFork2_#t~ite23_Out-42593029| ~y$r_buff1_thd2~0_In-42593029)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-42593029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42593029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-42593029, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-42593029|, ~weak$$choice2~0=~weak$$choice2~0_In-42593029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-42593029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-42593029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42593029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-42593029, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-42593029|, ~weak$$choice2~0=~weak$$choice2~0_In-42593029, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-42593029|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-42593029} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:00:30,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 17:00:30,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1476577969 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1476577969 256) 0))) (or (and (= ~y$w_buff0_used~0_In1476577969 |P2Thread1of1ForFork3_#t~ite28_Out1476577969|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out1476577969| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1476577969, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1476577969} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1476577969, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1476577969, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1476577969|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 17:00:30,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1580965555 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1580965555 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1580965555 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1580965555 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out-1580965555| ~y$w_buff1_used~0_In-1580965555) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite29_Out-1580965555| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1580965555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580965555, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1580965555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580965555} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1580965555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580965555, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1580965555, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1580965555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580965555} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 17:00:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-196838104 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-196838104 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-196838104 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-196838104 ~y$r_buff0_thd3~0_In-196838104)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-196838104} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-196838104|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-196838104} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:00:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In415894110 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In415894110 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In415894110 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In415894110 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out415894110| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite31_Out415894110| ~y$r_buff1_thd3~0_In415894110)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In415894110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In415894110, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In415894110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In415894110} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In415894110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In415894110, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In415894110, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out415894110|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In415894110} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 17:00:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:00:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:00:30,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out1672737811| |ULTIMATE.start_main_#t~ite43_Out1672737811|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1672737811 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1672737811 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1672737811| ~y$w_buff1~0_In1672737811) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In1672737811 |ULTIMATE.start_main_#t~ite42_Out1672737811|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1672737811, ~y~0=~y~0_In1672737811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1672737811, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1672737811|, ~y~0=~y~0_In1672737811, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1672737811|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:00:30,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-862311869 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-862311869 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-862311869| ~y$w_buff0_used~0_In-862311869) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-862311869| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-862311869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862311869} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-862311869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862311869, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-862311869|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:00:30,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1213558563 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1213558563 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1213558563 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1213558563 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1213558563| ~y$w_buff1_used~0_In1213558563) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1213558563| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1213558563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1213558563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1213558563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1213558563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1213558563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1213558563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1213558563, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1213558563|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1213558563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:00:30,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-770089026 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-770089026 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-770089026| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-770089026 |ULTIMATE.start_main_#t~ite46_Out-770089026|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-770089026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770089026} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-770089026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770089026, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-770089026|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:00:30,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In905116246 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In905116246 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In905116246 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In905116246 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out905116246| 0)) (and (= ~y$r_buff1_thd0~0_In905116246 |ULTIMATE.start_main_#t~ite47_Out905116246|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In905116246, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In905116246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In905116246, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out905116246|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In905116246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 17:00:30,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:00:30,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:00:30 BasicIcfg [2019-12-18 17:00:30,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:00:30,558 INFO L168 Benchmark]: Toolchain (without parser) took 163592.66 ms. Allocated memory was 138.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,559 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.45 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,561 INFO L168 Benchmark]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,561 INFO L168 Benchmark]: RCFGBuilder took 767.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 102.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,562 INFO L168 Benchmark]: TraceAbstraction took 161842.60 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:00:30,565 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.39 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 870.45 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.13 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 102.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 161842.60 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t728, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 161.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5237 SDtfs, 5974 SDslu, 14375 SDs, 0 SdLazy, 9535 SolverSat, 333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 61 SyntacticMatches, 22 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 198764 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1187 NumberOfCodeBlocks, 1187 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1102 ConstructedInterpolants, 0 QuantifiedInterpolants, 210070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...