/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/mix026_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:54:35,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:54:35,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:54:35,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:54:35,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:54:35,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:54:35,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:54:35,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:54:35,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:54:35,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:54:35,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:54:35,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:54:35,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:54:35,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:54:35,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:54:35,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:54:35,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:54:35,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:54:35,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:54:35,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:54:35,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:54:35,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:54:35,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:54:35,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:54:35,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:54:35,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:54:35,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:54:35,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:54:35,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:54:35,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:54:35,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:54:35,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:54:35,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:54:35,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:54:35,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:54:35,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:54:35,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:54:35,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:54:35,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:54:35,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:54:35,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:54:35,808 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:54:35,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:54:35,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:54:35,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:54:35,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:54:35,823 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:54:35,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:54:35,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:54:35,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:54:35,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:54:35,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:54:35,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:54:35,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:54:35,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:54:35,825 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:54:35,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:54:35,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:54:35,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:54:35,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:54:35,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:54:35,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:54:35,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:54:35,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:54:35,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:54:35,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:54:35,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:54:35,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:54:35,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:54:35,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:54:35,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:54:36,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:54:36,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:54:36,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:54:36,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:54:36,119 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:54:36,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 16:54:36,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f370df85/5b7e3a0882734d778234c23379e12d38/FLAG83feee02f [2019-12-18 16:54:36,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:54:36,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 16:54:36,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f370df85/5b7e3a0882734d778234c23379e12d38/FLAG83feee02f [2019-12-18 16:54:37,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f370df85/5b7e3a0882734d778234c23379e12d38 [2019-12-18 16:54:37,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:54:37,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:54:37,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:54:37,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:54:37,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:54:37,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37, skipping insertion in model container [2019-12-18 16:54:37,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:54:37,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:54:37,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:54:37,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:54:37,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:54:37,826 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:54:37,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37 WrapperNode [2019-12-18 16:54:37,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:54:37,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:54:37,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:54:37,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:54:37,834 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:54:37" (1/1) ... [2019-12-18 16:54:37,855 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:54:37" (1/1) ... [2019-12-18 16:54:37,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:54:37,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:54:37,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:54:37,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:54:37,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (1/1) ... [2019-12-18 16:54:37,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:54:37,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:54:37,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:54:37,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:54:37,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (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:54:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:54:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:54:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:54:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:54:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:54:37,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:54:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:54:37,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:54:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:54:37,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:54:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:54:37,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:54:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:54:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:54:37,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:54:38,002 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:54:38,750 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:54:38,751 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:54:38,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:54:38 BoogieIcfgContainer [2019-12-18 16:54:38,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:54:38,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:54:38,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:54:38,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:54:38,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:54:37" (1/3) ... [2019-12-18 16:54:38,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9117624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:54:38, skipping insertion in model container [2019-12-18 16:54:38,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:54:37" (2/3) ... [2019-12-18 16:54:38,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9117624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:54:38, skipping insertion in model container [2019-12-18 16:54:38,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:54:38" (3/3) ... [2019-12-18 16:54:38,761 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-18 16:54:38,772 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:54:38,772 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:54:38,780 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:54:38,781 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:54:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,874 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,874 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,883 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,891 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,892 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,903 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,906 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,925 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,925 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,926 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:54:38,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:54:38,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:54:38,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:54:38,959 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:54:38,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:54:38,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:54:38,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:54:38,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:54:38,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:54:38,977 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 16:54:38,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:54:39,078 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:54:39,079 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:54:39,100 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:54:39,127 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:54:39,189 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:54:39,191 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:54:39,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:54:39,221 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:54:39,222 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:54:45,128 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 16:54:45,282 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 16:54:45,317 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-18 16:54:45,318 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:54:45,321 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-18 16:55:13,781 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-18 16:55:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-18 16:55:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:55:13,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:13,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:13,790 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:55:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-18 16:55:13,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:13,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341618721] [2019-12-18 16:55:13,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:14,092 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:55:14,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341618721] [2019-12-18 16:55:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:14,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:55:14,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729591351] [2019-12-18 16:55:14,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:55:14,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:55:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:14,119 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-18 16:55:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:19,460 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-18 16:55:19,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:55:19,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:55:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:20,361 INFO L225 Difference]: With dead ends: 152486 [2019-12-18 16:55:20,361 INFO L226 Difference]: Without dead ends: 143750 [2019-12-18 16:55:20,362 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:55:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-18 16:55:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-18 16:55:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-18 16:55:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-18 16:55:34,064 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-18 16:55:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:34,064 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-18 16:55:34,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:55:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-18 16:55:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:55:34,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:34,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:34,080 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:55:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-18 16:55:34,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:34,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546171634] [2019-12-18 16:55:34,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:34,210 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:55:34,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546171634] [2019-12-18 16:55:34,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:34,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:55:34,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070538268] [2019-12-18 16:55:34,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:55:34,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:34,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:55:34,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:55:34,214 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-18 16:55:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:41,742 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-18 16:55:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:55:41,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:55:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:43,372 INFO L225 Difference]: With dead ends: 226574 [2019-12-18 16:55:43,372 INFO L226 Difference]: Without dead ends: 226406 [2019-12-18 16:55:43,373 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 16:55:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-18 16:55:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-18 16:55:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-18 16:55:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-18 16:55:56,284 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-18 16:55:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:56,285 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-18 16:55:56,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:55:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-18 16:55:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:55:56,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:56,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:56,291 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:55:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:56,291 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-18 16:55:56,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:56,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352478805] [2019-12-18 16:55:56,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:56,352 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:55:56,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352478805] [2019-12-18 16:55:56,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:56,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:55:56,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879465750] [2019-12-18 16:55:56,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:55:56,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:55:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:56,354 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 3 states. [2019-12-18 16:56:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:04,283 INFO L93 Difference]: Finished difference Result 131238 states and 546355 transitions. [2019-12-18 16:56:04,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:56:04,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:56:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:04,737 INFO L225 Difference]: With dead ends: 131238 [2019-12-18 16:56:04,737 INFO L226 Difference]: Without dead ends: 131238 [2019-12-18 16:56:04,737 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:56:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131238 states. [2019-12-18 16:56:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131238 to 131238. [2019-12-18 16:56:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131238 states. [2019-12-18 16:56:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131238 states to 131238 states and 546355 transitions. [2019-12-18 16:56:16,289 INFO L78 Accepts]: Start accepts. Automaton has 131238 states and 546355 transitions. Word has length 15 [2019-12-18 16:56:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:16,290 INFO L462 AbstractCegarLoop]: Abstraction has 131238 states and 546355 transitions. [2019-12-18 16:56:16,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:56:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 131238 states and 546355 transitions. [2019-12-18 16:56:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:56:16,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:16,295 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:56:16,295 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:56:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 437045286, now seen corresponding path program 1 times [2019-12-18 16:56:16,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:16,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217765650] [2019-12-18 16:56:16,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:16,383 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:56:16,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217765650] [2019-12-18 16:56:16,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:16,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064915236] [2019-12-18 16:56:16,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:56:16,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:56:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:56:16,386 INFO L87 Difference]: Start difference. First operand 131238 states and 546355 transitions. Second operand 4 states. [2019-12-18 16:56:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:16,564 INFO L93 Difference]: Finished difference Result 35878 states and 126762 transitions. [2019-12-18 16:56:16,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:56:16,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:56:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:16,667 INFO L225 Difference]: With dead ends: 35878 [2019-12-18 16:56:16,667 INFO L226 Difference]: Without dead ends: 35878 [2019-12-18 16:56:16,668 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:56:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35878 states. [2019-12-18 16:56:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35878 to 35878. [2019-12-18 16:56:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35878 states. [2019-12-18 16:56:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35878 states to 35878 states and 126762 transitions. [2019-12-18 16:56:17,934 INFO L78 Accepts]: Start accepts. Automaton has 35878 states and 126762 transitions. Word has length 16 [2019-12-18 16:56:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:17,934 INFO L462 AbstractCegarLoop]: Abstraction has 35878 states and 126762 transitions. [2019-12-18 16:56:17,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:56:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35878 states and 126762 transitions. [2019-12-18 16:56:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:56:17,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:17,936 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:56:17,937 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:56:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-18 16:56:17,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:17,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428232032] [2019-12-18 16:56:17,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:18,028 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:56:18,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428232032] [2019-12-18 16:56:18,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:18,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:18,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227064565] [2019-12-18 16:56:18,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:56:18,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:56:18,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:56:18,030 INFO L87 Difference]: Start difference. First operand 35878 states and 126762 transitions. Second operand 5 states. [2019-12-18 16:56:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:18,598 INFO L93 Difference]: Finished difference Result 51872 states and 179890 transitions. [2019-12-18 16:56:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:56:18,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:56:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:18,735 INFO L225 Difference]: With dead ends: 51872 [2019-12-18 16:56:18,735 INFO L226 Difference]: Without dead ends: 51856 [2019-12-18 16:56:18,736 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:56:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51856 states. [2019-12-18 16:56:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51856 to 40170. [2019-12-18 16:56:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40170 states. [2019-12-18 16:56:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40170 states to 40170 states and 141309 transitions. [2019-12-18 16:56:22,628 INFO L78 Accepts]: Start accepts. Automaton has 40170 states and 141309 transitions. Word has length 16 [2019-12-18 16:56:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:22,628 INFO L462 AbstractCegarLoop]: Abstraction has 40170 states and 141309 transitions. [2019-12-18 16:56:22,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:56:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40170 states and 141309 transitions. [2019-12-18 16:56:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:56:22,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:22,645 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:56:22,645 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:56:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-18 16:56:22,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:22,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876570373] [2019-12-18 16:56:22,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:22,764 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:56:22,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876570373] [2019-12-18 16:56:22,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:22,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:56:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324914366] [2019-12-18 16:56:22,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:56:22,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:56:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:56:22,766 INFO L87 Difference]: Start difference. First operand 40170 states and 141309 transitions. Second operand 6 states. [2019-12-18 16:56:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:23,829 INFO L93 Difference]: Finished difference Result 61953 states and 212351 transitions. [2019-12-18 16:56:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:56:23,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 16:56:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:23,953 INFO L225 Difference]: With dead ends: 61953 [2019-12-18 16:56:23,953 INFO L226 Difference]: Without dead ends: 61925 [2019-12-18 16:56:23,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:56:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61925 states. [2019-12-18 16:56:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61925 to 41940. [2019-12-18 16:56:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41940 states. [2019-12-18 16:56:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41940 states to 41940 states and 146496 transitions. [2019-12-18 16:56:25,265 INFO L78 Accepts]: Start accepts. Automaton has 41940 states and 146496 transitions. Word has length 24 [2019-12-18 16:56:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:25,265 INFO L462 AbstractCegarLoop]: Abstraction has 41940 states and 146496 transitions. [2019-12-18 16:56:25,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:56:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41940 states and 146496 transitions. [2019-12-18 16:56:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:56:25,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:25,288 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 16:56:25,289 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 16:56:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 324599252, now seen corresponding path program 1 times [2019-12-18 16:56:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142445347] [2019-12-18 16:56:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:25,377 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:56:25,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142445347] [2019-12-18 16:56:25,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:25,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:56:25,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8276084] [2019-12-18 16:56:25,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:56:25,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:25,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:56:25,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:56:25,380 INFO L87 Difference]: Start difference. First operand 41940 states and 146496 transitions. Second operand 5 states. [2019-12-18 16:56:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:25,522 INFO L93 Difference]: Finished difference Result 21549 states and 76131 transitions. [2019-12-18 16:56:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:56:25,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:56:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:25,561 INFO L225 Difference]: With dead ends: 21549 [2019-12-18 16:56:25,561 INFO L226 Difference]: Without dead ends: 21549 [2019-12-18 16:56:25,562 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 16:56:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21549 states. [2019-12-18 16:56:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21549 to 21357. [2019-12-18 16:56:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21357 states. [2019-12-18 16:56:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21357 states to 21357 states and 75475 transitions. [2019-12-18 16:56:25,921 INFO L78 Accepts]: Start accepts. Automaton has 21357 states and 75475 transitions. Word has length 28 [2019-12-18 16:56:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:25,921 INFO L462 AbstractCegarLoop]: Abstraction has 21357 states and 75475 transitions. [2019-12-18 16:56:25,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:56:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21357 states and 75475 transitions. [2019-12-18 16:56:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:56:25,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:25,956 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 16:56:25,956 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 16:56:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-18 16:56:25,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:25,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916610207] [2019-12-18 16:56:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:26,048 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:56:26,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916610207] [2019-12-18 16:56:26,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:26,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:56:26,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388129150] [2019-12-18 16:56:26,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:56:26,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:56:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:56:26,051 INFO L87 Difference]: Start difference. First operand 21357 states and 75475 transitions. Second operand 6 states. [2019-12-18 16:56:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:26,173 INFO L93 Difference]: Finished difference Result 20070 states and 72184 transitions. [2019-12-18 16:56:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:56:26,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 16:56:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:26,212 INFO L225 Difference]: With dead ends: 20070 [2019-12-18 16:56:26,212 INFO L226 Difference]: Without dead ends: 20070 [2019-12-18 16:56:26,213 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 16:56:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2019-12-18 16:56:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19446. [2019-12-18 16:56:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19446 states. [2019-12-18 16:56:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19446 states to 19446 states and 70120 transitions. [2019-12-18 16:56:26,550 INFO L78 Accepts]: Start accepts. Automaton has 19446 states and 70120 transitions. Word has length 42 [2019-12-18 16:56:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 19446 states and 70120 transitions. [2019-12-18 16:56:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:56:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19446 states and 70120 transitions. [2019-12-18 16:56:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:26,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:26,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:26,586 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 16:56:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2124071368, now seen corresponding path program 1 times [2019-12-18 16:56:26,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:26,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401261826] [2019-12-18 16:56:26,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:26,642 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:56:26,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401261826] [2019-12-18 16:56:26,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:26,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:26,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358653712] [2019-12-18 16:56:26,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:56:26,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:26,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:56:26,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:56:26,645 INFO L87 Difference]: Start difference. First operand 19446 states and 70120 transitions. Second operand 3 states. [2019-12-18 16:56:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:27,061 INFO L93 Difference]: Finished difference Result 28624 states and 103119 transitions. [2019-12-18 16:56:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:56:27,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 16:56:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:27,141 INFO L225 Difference]: With dead ends: 28624 [2019-12-18 16:56:27,142 INFO L226 Difference]: Without dead ends: 28624 [2019-12-18 16:56:27,142 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 16:56:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28624 states. [2019-12-18 16:56:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28624 to 22286. [2019-12-18 16:56:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22286 states. [2019-12-18 16:56:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22286 states to 22286 states and 80860 transitions. [2019-12-18 16:56:27,618 INFO L78 Accepts]: Start accepts. Automaton has 22286 states and 80860 transitions. Word has length 56 [2019-12-18 16:56:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:27,619 INFO L462 AbstractCegarLoop]: Abstraction has 22286 states and 80860 transitions. [2019-12-18 16:56:27,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:56:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22286 states and 80860 transitions. [2019-12-18 16:56:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:27,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:27,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:27,661 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 16:56:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1367478236, now seen corresponding path program 1 times [2019-12-18 16:56:27,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:27,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096413504] [2019-12-18 16:56:27,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:27,791 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:56:27,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096413504] [2019-12-18 16:56:27,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:27,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:27,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139906250] [2019-12-18 16:56:27,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:56:27,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:56:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:56:27,795 INFO L87 Difference]: Start difference. First operand 22286 states and 80860 transitions. Second operand 4 states. [2019-12-18 16:56:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:27,936 INFO L93 Difference]: Finished difference Result 31580 states and 109851 transitions. [2019-12-18 16:56:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:56:27,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 16:56:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:27,976 INFO L225 Difference]: With dead ends: 31580 [2019-12-18 16:56:27,976 INFO L226 Difference]: Without dead ends: 20426 [2019-12-18 16:56:27,976 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 16:56:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20426 states. [2019-12-18 16:56:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20426 to 20426. [2019-12-18 16:56:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20426 states. [2019-12-18 16:56:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20426 states to 20426 states and 73106 transitions. [2019-12-18 16:56:28,316 INFO L78 Accepts]: Start accepts. Automaton has 20426 states and 73106 transitions. Word has length 56 [2019-12-18 16:56:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:28,317 INFO L462 AbstractCegarLoop]: Abstraction has 20426 states and 73106 transitions. [2019-12-18 16:56:28,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:56:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20426 states and 73106 transitions. [2019-12-18 16:56:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:28,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:28,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:28,344 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 16:56:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -409451146, now seen corresponding path program 2 times [2019-12-18 16:56:28,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:28,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918460942] [2019-12-18 16:56:28,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:28,417 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:56:28,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918460942] [2019-12-18 16:56:28,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:28,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:28,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903077059] [2019-12-18 16:56:28,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:56:28,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:56:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:56:28,419 INFO L87 Difference]: Start difference. First operand 20426 states and 73106 transitions. Second operand 4 states. [2019-12-18 16:56:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:28,748 INFO L93 Difference]: Finished difference Result 29468 states and 101361 transitions. [2019-12-18 16:56:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:56:28,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 16:56:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:28,767 INFO L225 Difference]: With dead ends: 29468 [2019-12-18 16:56:28,767 INFO L226 Difference]: Without dead ends: 9593 [2019-12-18 16:56:28,767 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 16:56:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2019-12-18 16:56:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 9593. [2019-12-18 16:56:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2019-12-18 16:56:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 29814 transitions. [2019-12-18 16:56:28,987 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 29814 transitions. Word has length 56 [2019-12-18 16:56:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:28,987 INFO L462 AbstractCegarLoop]: Abstraction has 9593 states and 29814 transitions. [2019-12-18 16:56:28,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:56:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 29814 transitions. [2019-12-18 16:56:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:29,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:29,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:29,002 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 16:56:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1090544788, now seen corresponding path program 1 times [2019-12-18 16:56:29,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:29,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926377979] [2019-12-18 16:56:29,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:29,063 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:56:29,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926377979] [2019-12-18 16:56:29,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:29,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:56:29,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019427588] [2019-12-18 16:56:29,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:56:29,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:29,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:56:29,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:56:29,066 INFO L87 Difference]: Start difference. First operand 9593 states and 29814 transitions. Second operand 3 states. [2019-12-18 16:56:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:29,145 INFO L93 Difference]: Finished difference Result 11649 states and 35156 transitions. [2019-12-18 16:56:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:56:29,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 16:56:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:29,165 INFO L225 Difference]: With dead ends: 11649 [2019-12-18 16:56:29,165 INFO L226 Difference]: Without dead ends: 11325 [2019-12-18 16:56:29,166 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 16:56:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11325 states. [2019-12-18 16:56:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11325 to 9701. [2019-12-18 16:56:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9701 states. [2019-12-18 16:56:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9701 states to 9701 states and 29512 transitions. [2019-12-18 16:56:29,339 INFO L78 Accepts]: Start accepts. Automaton has 9701 states and 29512 transitions. Word has length 56 [2019-12-18 16:56:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:29,340 INFO L462 AbstractCegarLoop]: Abstraction has 9701 states and 29512 transitions. [2019-12-18 16:56:29,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:56:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9701 states and 29512 transitions. [2019-12-18 16:56:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:29,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:29,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:29,350 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 16:56:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1851629426, now seen corresponding path program 3 times [2019-12-18 16:56:29,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:29,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010623851] [2019-12-18 16:56:29,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:29,449 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:56:29,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010623851] [2019-12-18 16:56:29,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:29,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:56:29,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648849906] [2019-12-18 16:56:29,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:56:29,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:56:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:56:29,452 INFO L87 Difference]: Start difference. First operand 9701 states and 29512 transitions. Second operand 7 states. [2019-12-18 16:56:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:29,882 INFO L93 Difference]: Finished difference Result 26685 states and 80710 transitions. [2019-12-18 16:56:29,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:56:29,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 16:56:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:29,911 INFO L225 Difference]: With dead ends: 26685 [2019-12-18 16:56:29,911 INFO L226 Difference]: Without dead ends: 20531 [2019-12-18 16:56:29,912 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 16:56:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20531 states. [2019-12-18 16:56:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20531 to 12175. [2019-12-18 16:56:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-12-18 16:56:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 37257 transitions. [2019-12-18 16:56:30,153 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 37257 transitions. Word has length 56 [2019-12-18 16:56:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:30,153 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 37257 transitions. [2019-12-18 16:56:30,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:56:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 37257 transitions. [2019-12-18 16:56:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:30,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:30,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:30,165 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 16:56:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1882211558, now seen corresponding path program 4 times [2019-12-18 16:56:30,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:30,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265967360] [2019-12-18 16:56:30,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:30,263 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:56:30,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265967360] [2019-12-18 16:56:30,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:30,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:56:30,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622894504] [2019-12-18 16:56:30,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:56:30,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:56:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:56:30,266 INFO L87 Difference]: Start difference. First operand 12175 states and 37257 transitions. Second operand 7 states. [2019-12-18 16:56:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:30,692 INFO L93 Difference]: Finished difference Result 33792 states and 100998 transitions. [2019-12-18 16:56:30,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:56:30,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 16:56:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:30,726 INFO L225 Difference]: With dead ends: 33792 [2019-12-18 16:56:30,726 INFO L226 Difference]: Without dead ends: 24259 [2019-12-18 16:56:30,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:56:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24259 states. [2019-12-18 16:56:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24259 to 14950. [2019-12-18 16:56:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14950 states. [2019-12-18 16:56:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 45664 transitions. [2019-12-18 16:56:31,149 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 45664 transitions. Word has length 56 [2019-12-18 16:56:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:31,149 INFO L462 AbstractCegarLoop]: Abstraction has 14950 states and 45664 transitions. [2019-12-18 16:56:31,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:56:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 45664 transitions. [2019-12-18 16:56:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:31,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:31,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:31,165 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 16:56:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1708028504, now seen corresponding path program 5 times [2019-12-18 16:56:31,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:31,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134872653] [2019-12-18 16:56:31,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:31,257 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:56:31,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134872653] [2019-12-18 16:56:31,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:31,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:56:31,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656769754] [2019-12-18 16:56:31,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:56:31,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:56:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:56:31,259 INFO L87 Difference]: Start difference. First operand 14950 states and 45664 transitions. Second operand 7 states. [2019-12-18 16:56:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:31,686 INFO L93 Difference]: Finished difference Result 29762 states and 88396 transitions. [2019-12-18 16:56:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:56:31,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 16:56:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:31,736 INFO L225 Difference]: With dead ends: 29762 [2019-12-18 16:56:31,736 INFO L226 Difference]: Without dead ends: 24890 [2019-12-18 16:56:31,736 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 16:56:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-12-18 16:56:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 15160. [2019-12-18 16:56:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15160 states. [2019-12-18 16:56:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 46251 transitions. [2019-12-18 16:56:32,066 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 46251 transitions. Word has length 56 [2019-12-18 16:56:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:32,066 INFO L462 AbstractCegarLoop]: Abstraction has 15160 states and 46251 transitions. [2019-12-18 16:56:32,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:56:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 46251 transitions. [2019-12-18 16:56:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:32,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:32,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:32,082 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 16:56:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash -373595762, now seen corresponding path program 6 times [2019-12-18 16:56:32,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:32,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138307395] [2019-12-18 16:56:32,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:32,194 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:56:32,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138307395] [2019-12-18 16:56:32,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:32,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:56:32,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32576687] [2019-12-18 16:56:32,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:56:32,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:56:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:56:32,196 INFO L87 Difference]: Start difference. First operand 15160 states and 46251 transitions. Second operand 7 states. [2019-12-18 16:56:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:33,322 INFO L93 Difference]: Finished difference Result 25062 states and 73716 transitions. [2019-12-18 16:56:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:56:33,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 16:56:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:33,356 INFO L225 Difference]: With dead ends: 25062 [2019-12-18 16:56:33,357 INFO L226 Difference]: Without dead ends: 24936 [2019-12-18 16:56:33,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:56:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24936 states. [2019-12-18 16:56:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24936 to 16054. [2019-12-18 16:56:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16054 states. [2019-12-18 16:56:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16054 states to 16054 states and 48825 transitions. [2019-12-18 16:56:33,655 INFO L78 Accepts]: Start accepts. Automaton has 16054 states and 48825 transitions. Word has length 56 [2019-12-18 16:56:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:33,656 INFO L462 AbstractCegarLoop]: Abstraction has 16054 states and 48825 transitions. [2019-12-18 16:56:33,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:56:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16054 states and 48825 transitions. [2019-12-18 16:56:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:56:33,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:33,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:56:33,673 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 16:56:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1994896084, now seen corresponding path program 7 times [2019-12-18 16:56:33,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:33,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299681777] [2019-12-18 16:56:33,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:33,823 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:56:33,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299681777] [2019-12-18 16:56:33,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:33,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:56:33,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118653485] [2019-12-18 16:56:33,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:56:33,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:56:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:56:33,826 INFO L87 Difference]: Start difference. First operand 16054 states and 48825 transitions. Second operand 3 states. [2019-12-18 16:56:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:33,996 INFO L93 Difference]: Finished difference Result 16052 states and 48820 transitions. [2019-12-18 16:56:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:56:33,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 16:56:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:34,032 INFO L225 Difference]: With dead ends: 16052 [2019-12-18 16:56:34,033 INFO L226 Difference]: Without dead ends: 16052 [2019-12-18 16:56:34,033 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 16:56:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16052 states. [2019-12-18 16:56:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16052 to 14388. [2019-12-18 16:56:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14388 states. [2019-12-18 16:56:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14388 states to 14388 states and 44292 transitions. [2019-12-18 16:56:34,411 INFO L78 Accepts]: Start accepts. Automaton has 14388 states and 44292 transitions. Word has length 56 [2019-12-18 16:56:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:34,412 INFO L462 AbstractCegarLoop]: Abstraction has 14388 states and 44292 transitions. [2019-12-18 16:56:34,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:56:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14388 states and 44292 transitions. [2019-12-18 16:56:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:56:34,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:34,435 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 16:56:34,436 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 16:56:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash 423913779, now seen corresponding path program 1 times [2019-12-18 16:56:34,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:34,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998607980] [2019-12-18 16:56:34,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:56:34,518 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:56:34,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998607980] [2019-12-18 16:56:34,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:56:34,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:56:34,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261749631] [2019-12-18 16:56:34,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:56:34,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:56:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:56:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:56:34,520 INFO L87 Difference]: Start difference. First operand 14388 states and 44292 transitions. Second operand 3 states. [2019-12-18 16:56:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:56:34,582 INFO L93 Difference]: Finished difference Result 11370 states and 34226 transitions. [2019-12-18 16:56:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:56:34,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:56:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:56:34,603 INFO L225 Difference]: With dead ends: 11370 [2019-12-18 16:56:34,603 INFO L226 Difference]: Without dead ends: 11370 [2019-12-18 16:56:34,605 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 16:56:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11370 states. [2019-12-18 16:56:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11370 to 10841. [2019-12-18 16:56:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10841 states. [2019-12-18 16:56:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10841 states to 10841 states and 32624 transitions. [2019-12-18 16:56:34,770 INFO L78 Accepts]: Start accepts. Automaton has 10841 states and 32624 transitions. Word has length 57 [2019-12-18 16:56:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:56:34,770 INFO L462 AbstractCegarLoop]: Abstraction has 10841 states and 32624 transitions. [2019-12-18 16:56:34,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:56:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10841 states and 32624 transitions. [2019-12-18 16:56:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:56:34,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:56:34,780 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 16:56:34,780 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 16:56:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:56:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 1 times [2019-12-18 16:56:34,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:56:34,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078175532] [2019-12-18 16:56:34,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:56:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:56:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:56:34,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:56:34,934 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:56:34,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:56:34,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:56:34,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-18 16:56:34,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~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_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~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_25} 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 16:56:34,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-18 16:56:34,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:56:34,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1887170244 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1887170244| |P1Thread1of1ForFork2_#t~ite11_Out-1887170244|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1887170244 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1887170244 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1887170244 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1887170244 256)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-1887170244| ~y$w_buff1~0_In-1887170244)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1887170244| ~y$w_buff1~0_In-1887170244) (= |P1Thread1of1ForFork2_#t~ite11_In-1887170244| |P1Thread1of1ForFork2_#t~ite11_Out-1887170244|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887170244, ~y$w_buff1~0=~y$w_buff1~0_In-1887170244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887170244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887170244, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1887170244|, ~weak$$choice2~0=~weak$$choice2~0_In-1887170244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887170244} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887170244, ~y$w_buff1~0=~y$w_buff1~0_In-1887170244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887170244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887170244, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1887170244|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1887170244|, ~weak$$choice2~0=~weak$$choice2~0_In-1887170244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887170244} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:56:34,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1684941584 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1684941584 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1684941584 256) 0)) (= (mod ~y$w_buff0_used~0_In1684941584 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1684941584 256))))) (= ~y$w_buff0_used~0_In1684941584 |P1Thread1of1ForFork2_#t~ite14_Out1684941584|) (= |P1Thread1of1ForFork2_#t~ite14_Out1684941584| |P1Thread1of1ForFork2_#t~ite15_Out1684941584|) .cse1) (and (= ~y$w_buff0_used~0_In1684941584 |P1Thread1of1ForFork2_#t~ite15_Out1684941584|) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite14_In1684941584| |P1Thread1of1ForFork2_#t~ite14_Out1684941584|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1684941584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1684941584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1684941584, ~weak$$choice2~0=~weak$$choice2~0_In1684941584, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1684941584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1684941584} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1684941584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1684941584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1684941584, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1684941584|, ~weak$$choice2~0=~weak$$choice2~0_In1684941584, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1684941584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1684941584} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 16:56:34,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse4 (= 0 (mod ~y$w_buff1_used~0_In-1763465691 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1763465691 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1763465691 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1763465691 256) 0)) (.cse5 (= |P1Thread1of1ForFork2_#t~ite18_Out-1763465691| |P1Thread1of1ForFork2_#t~ite17_Out-1763465691|)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1763465691 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite16_In-1763465691| |P1Thread1of1ForFork2_#t~ite16_Out-1763465691|) (or (and (= ~y$w_buff1_used~0_In-1763465691 |P1Thread1of1ForFork2_#t~ite18_Out-1763465691|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite17_In-1763465691| |P1Thread1of1ForFork2_#t~ite17_Out-1763465691|)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1)) .cse0 .cse5 (= ~y$w_buff1_used~0_In-1763465691 |P1Thread1of1ForFork2_#t~ite17_Out-1763465691|)))) (let ((.cse6 (not .cse1))) (and (or .cse6 (not .cse4)) (not .cse3) .cse0 (or (not .cse2) .cse6) (= |P1Thread1of1ForFork2_#t~ite17_Out-1763465691| |P1Thread1of1ForFork2_#t~ite16_Out-1763465691|) .cse5 (= 0 |P1Thread1of1ForFork2_#t~ite16_Out-1763465691|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1763465691, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In-1763465691|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1763465691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1763465691, ~weak$$choice2~0=~weak$$choice2~0_In-1763465691, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In-1763465691|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1763465691} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out-1763465691|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1763465691, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out-1763465691|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1763465691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1763465691, ~weak$$choice2~0=~weak$$choice2~0_In-1763465691, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out-1763465691|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1763465691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 16:56:34,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (not (= 0 (mod v_~weak$$choice2~0_200 256))) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_33|)) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_33|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_32|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_30|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_37|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_15|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:56:34,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In472336996 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In472336996 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In472336996 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In472336996 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In472336996 256))))) .cse1 (= |P1Thread1of1ForFork2_#t~ite24_Out472336996| |P1Thread1of1ForFork2_#t~ite23_Out472336996|) (= ~y$r_buff1_thd2~0_In472336996 |P1Thread1of1ForFork2_#t~ite23_Out472336996|)) (and (= |P1Thread1of1ForFork2_#t~ite23_In472336996| |P1Thread1of1ForFork2_#t~ite23_Out472336996|) (not .cse1) (= ~y$r_buff1_thd2~0_In472336996 |P1Thread1of1ForFork2_#t~ite24_Out472336996|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In472336996, ~y$w_buff0_used~0=~y$w_buff0_used~0_In472336996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In472336996, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In472336996|, ~weak$$choice2~0=~weak$$choice2~0_In472336996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472336996} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In472336996, ~y$w_buff0_used~0=~y$w_buff0_used~0_In472336996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In472336996, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out472336996|, ~weak$$choice2~0=~weak$$choice2~0_In472336996, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out472336996|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472336996} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 16:56:34,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:56:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-92489743 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-92489743 256) 0)) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-92489743| |P3Thread1of1ForFork0_#t~ite32_Out-92489743|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-92489743 |P3Thread1of1ForFork0_#t~ite32_Out-92489743|) (not .cse2)) (and (= ~y~0_In-92489743 |P3Thread1of1ForFork0_#t~ite32_Out-92489743|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-92489743, ~y$w_buff1~0=~y$w_buff1~0_In-92489743, ~y~0=~y~0_In-92489743, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-92489743} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-92489743, ~y$w_buff1~0=~y$w_buff1~0_In-92489743, ~y~0=~y~0_In-92489743, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-92489743|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-92489743|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-92489743} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:56:34,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1604719015 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1604719015 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1604719015| ~y$w_buff0_used~0_In1604719015)) (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1604719015|) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1604719015, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604719015} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1604719015, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604719015, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1604719015|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 16:56:34,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1006294769 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1006294769 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-1006294769 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1006294769 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-1006294769|)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1006294769| ~y$w_buff1_used~0_In-1006294769) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1006294769, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1006294769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1006294769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1006294769} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1006294769, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1006294769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1006294769, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1006294769|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1006294769} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 16:56:34,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1561782194 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1561782194 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-1561782194 |P3Thread1of1ForFork0_#t~ite36_Out-1561782194|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1561782194|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1561782194, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561782194} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1561782194, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561782194, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1561782194|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 16:56:34,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In794487533 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In794487533 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In794487533 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In794487533 256)))) (or (and (= ~y$r_buff1_thd4~0_In794487533 |P3Thread1of1ForFork0_#t~ite37_Out794487533|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out794487533|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In794487533, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In794487533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In794487533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794487533} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In794487533, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In794487533, ~y$w_buff0_used~0=~y$w_buff0_used~0_In794487533, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out794487533|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794487533} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 16:56:34,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_54| v_~y$r_buff1_thd4~0_148)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_53|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} 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 16:56:34,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In530089526 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In530089526 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In530089526 |P2Thread1of1ForFork3_#t~ite28_Out530089526|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out530089526| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In530089526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In530089526} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In530089526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In530089526, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out530089526|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 16:56:34,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1275290089 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1275290089 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1275290089 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1275290089 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1275290089| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1275290089| ~y$w_buff1_used~0_In-1275290089) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1275290089, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275290089, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1275290089, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1275290089} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1275290089, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275290089, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1275290089, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1275290089|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1275290089} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 16:56:34,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In849867527 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In849867527 256)))) (or (and (= ~y$r_buff0_thd3~0_Out849867527 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In849867527 ~y$r_buff0_thd3~0_Out849867527) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In849867527, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In849867527} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out849867527|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In849867527, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out849867527} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 16:56:34,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-710957442 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-710957442 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-710957442 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-710957442 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-710957442| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-710957442| ~y$r_buff1_thd3~0_In-710957442) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-710957442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-710957442, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-710957442, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-710957442} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-710957442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-710957442, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-710957442, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-710957442|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-710957442} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 16:56:34,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_48| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_47|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, 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 16:56:34,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:56:34,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In171038317 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In171038317 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In171038317 |ULTIMATE.start_main_#t~ite42_Out171038317|)) (and (= ~y$w_buff1~0_In171038317 |ULTIMATE.start_main_#t~ite42_Out171038317|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In171038317, ~y~0=~y~0_In171038317, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In171038317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171038317} OutVars{~y$w_buff1~0=~y$w_buff1~0_In171038317, ~y~0=~y~0_In171038317, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out171038317|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In171038317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171038317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:56:34,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:56:34,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1588776342 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1588776342 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1588776342| ~y$w_buff0_used~0_In1588776342)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1588776342| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1588776342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1588776342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1588776342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1588776342, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1588776342|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:56:34,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1678074245 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1678074245 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1678074245 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1678074245 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1678074245 |ULTIMATE.start_main_#t~ite45_Out-1678074245|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1678074245|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678074245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678074245, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1678074245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1678074245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678074245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678074245, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1678074245, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1678074245|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1678074245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:56:34,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-356872967 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-356872967 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-356872967 |ULTIMATE.start_main_#t~ite46_Out-356872967|)) (and (= |ULTIMATE.start_main_#t~ite46_Out-356872967| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-356872967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-356872967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-356872967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-356872967, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-356872967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:56:34,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In246778528 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In246778528 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In246778528 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In246778528 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In246778528 |ULTIMATE.start_main_#t~ite47_Out246778528|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite47_Out246778528|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In246778528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In246778528, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In246778528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In246778528} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In246778528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In246778528, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out246778528|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In246778528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In246778528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:56:34,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_155 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, 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 16:56:35,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:56:35 BasicIcfg [2019-12-18 16:56:35,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:56:35,091 INFO L168 Benchmark]: Toolchain (without parser) took 118033.43 ms. Allocated memory was 142.6 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,092 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 142.6 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.92 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 152.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.73 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,094 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,094 INFO L168 Benchmark]: RCFGBuilder took 825.57 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 98.5 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,095 INFO L168 Benchmark]: TraceAbstraction took 116335.79 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 97.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:56:35,099 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.50 ms. Allocated memory is still 142.6 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.92 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 152.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.73 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.57 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 98.5 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 116335.79 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 97.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L820] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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}, 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] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L760] 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_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L760] 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) [L761] 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_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L761] 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)) [L762] 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)) [L763] 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)) [L766] 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)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L820] 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) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L797] 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) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L855] 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_p0_EAX=0, __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=1, 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] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2973 SDtfs, 3016 SDslu, 6412 SDs, 0 SdLazy, 2586 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210054occurred 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: 48.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 95271 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 120646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...