/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/mix016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:29:55,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:29:55,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:29:55,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:29:55,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:29:55,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:29:55,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:29:55,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:29:55,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:29:55,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:29:55,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:29:55,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:29:55,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:29:55,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:29:55,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:29:55,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:29:55,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:29:55,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:29:55,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:29:55,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:29:55,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:29:55,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:29:55,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:29:55,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:29:55,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:29:55,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:29:55,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:29:55,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:29:55,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:29:55,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:29:55,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:29:55,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:29:55,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:29:55,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:29:55,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:29:55,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:29:55,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:29:55,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:29:55,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:29:55,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:29:55,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:29:55,975 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:29:55,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:29:55,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:29:55,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:29:55,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:29:55,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:29:55,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:29:55,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:29:55,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:29:55,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:29:56,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:29:56,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:29:56,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:29:56,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:29:56,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:29:56,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:29:56,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:29:56,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:29:56,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:29:56,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:29:56,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:29:56,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:29:56,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:29:56,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:29:56,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:29:56,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:29:56,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:29:56,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:29:56,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:29:56,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:29:56,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:29:56,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:29:56,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:29:56,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:29:56,317 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:29:56,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-18 16:29:56,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a19e5a/b92d074f096b415ea1c93160a4d2883f/FLAG902580706 [2019-12-18 16:29:56,987 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:29:56,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-18 16:29:57,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a19e5a/b92d074f096b415ea1c93160a4d2883f/FLAG902580706 [2019-12-18 16:29:57,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a19e5a/b92d074f096b415ea1c93160a4d2883f [2019-12-18 16:29:57,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:29:57,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:29:57,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:29:57,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:29:57,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:29:57,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:29:57" (1/1) ... [2019-12-18 16:29:57,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b110275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:57, skipping insertion in model container [2019-12-18 16:29:57,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:29:57" (1/1) ... [2019-12-18 16:29:57,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:29:57,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:29:57,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:29:57,977 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:29:58,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:29:58,118 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:29:58,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58 WrapperNode [2019-12-18 16:29:58,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:29:58,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:29:58,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:29:58,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:29:58,128 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:29:58" (1/1) ... [2019-12-18 16:29:58,155 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:29:58" (1/1) ... [2019-12-18 16:29:58,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:29:58,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:29:58,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:29:58,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:29:58,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (1/1) ... [2019-12-18 16:29:58,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:29:58,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:29:58,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:29:58,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:29:58,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (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:29:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:29:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:29:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:29:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:29:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:29:58,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:29:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:29:58,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:29:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:29:58,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:29:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:29:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:29:58,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:29:58,295 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:29:59,034 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:29:59,034 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:29:59,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:29:59 BoogieIcfgContainer [2019-12-18 16:29:59,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:29:59,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:29:59,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:29:59,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:29:59,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:29:57" (1/3) ... [2019-12-18 16:29:59,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceae40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:29:59, skipping insertion in model container [2019-12-18 16:29:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:29:58" (2/3) ... [2019-12-18 16:29:59,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceae40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:29:59, skipping insertion in model container [2019-12-18 16:29:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:29:59" (3/3) ... [2019-12-18 16:29:59,044 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.opt.i [2019-12-18 16:29:59,053 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:29:59,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:29:59,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:29:59,061 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:29:59,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,182 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:29:59,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:29:59,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:29:59,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:29:59,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:29:59,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:29:59,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:29:59,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:29:59,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:29:59,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:29:59,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 16:29:59,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 16:29:59,347 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 16:29:59,347 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:29:59,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:29:59,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 16:29:59,491 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 16:29:59,491 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:29:59,503 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:29:59,526 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:29:59,527 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:30:04,697 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:30:04,804 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:30:05,196 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 16:30:05,334 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:30:05,363 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-18 16:30:05,363 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 16:30:05,366 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 16:30:16,077 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-18 16:30:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-18 16:30:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:30:16,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:16,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:30:16,087 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-18 16:30:16,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:16,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104068817] [2019-12-18 16:30:16,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:16,359 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:30:16,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104068817] [2019-12-18 16:30:16,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:16,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:30:16,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939907475] [2019-12-18 16:30:16,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:16,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:16,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:16,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:16,382 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-18 16:30:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:19,642 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-18 16:30:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:19,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:30:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:20,243 INFO L225 Difference]: With dead ends: 85100 [2019-12-18 16:30:20,243 INFO L226 Difference]: Without dead ends: 79822 [2019-12-18 16:30:20,245 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:30:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-18 16:30:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-18 16:30:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-18 16:30:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-18 16:30:27,582 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-18 16:30:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:27,582 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-18 16:30:27,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-18 16:30:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:30:27,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:27,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:27,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-18 16:30:27,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:27,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158141034] [2019-12-18 16:30:27,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:27,720 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:30:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158141034] [2019-12-18 16:30:27,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:27,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:27,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268005494] [2019-12-18 16:30:27,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:27,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:27,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:27,723 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-18 16:30:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:27,910 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-18 16:30:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:27,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:30:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:27,970 INFO L225 Difference]: With dead ends: 21012 [2019-12-18 16:30:27,970 INFO L226 Difference]: Without dead ends: 21012 [2019-12-18 16:30:27,971 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:30:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-18 16:30:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-18 16:30:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-18 16:30:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-18 16:30:31,664 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-18 16:30:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:31,664 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-18 16:30:31,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-18 16:30:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:30:31,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:31,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:31,669 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-18 16:30:31,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:31,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797625358] [2019-12-18 16:30:31,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:31,802 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:30:31,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797625358] [2019-12-18 16:30:31,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:31,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:31,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25119207] [2019-12-18 16:30:31,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:31,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:31,805 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-18 16:30:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:32,267 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-18 16:30:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:32,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:30:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:32,349 INFO L225 Difference]: With dead ends: 31168 [2019-12-18 16:30:32,349 INFO L226 Difference]: Without dead ends: 31154 [2019-12-18 16:30:32,350 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:30:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-18 16:30:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-18 16:30:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-18 16:30:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-18 16:30:33,361 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-18 16:30:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:33,362 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-18 16:30:33,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-18 16:30:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:30:33,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:33,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:33,367 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-18 16:30:33,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:33,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067754367] [2019-12-18 16:30:33,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:33,450 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:30:33,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067754367] [2019-12-18 16:30:33,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:33,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:33,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823221923] [2019-12-18 16:30:33,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:30:33,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:33,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:30:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:30:33,457 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-18 16:30:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:34,020 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-18 16:30:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:30:34,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 16:30:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:34,121 INFO L225 Difference]: With dead ends: 40618 [2019-12-18 16:30:34,121 INFO L226 Difference]: Without dead ends: 40602 [2019-12-18 16:30:34,122 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:30:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-18 16:30:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-18 16:30:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-18 16:30:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-18 16:30:35,334 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-18 16:30:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:35,337 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-18 16:30:35,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:30:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-18 16:30:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:30:35,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:35,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] [2019-12-18 16:30:35,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-18 16:30:35,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:35,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493006030] [2019-12-18 16:30:35,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:35,465 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:30:35,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493006030] [2019-12-18 16:30:35,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:35,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:30:35,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037591157] [2019-12-18 16:30:35,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:30:35,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:30:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:30:35,467 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-18 16:30:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:36,437 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-18 16:30:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:30:36,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:30:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:36,560 INFO L225 Difference]: With dead ends: 48617 [2019-12-18 16:30:36,560 INFO L226 Difference]: Without dead ends: 48589 [2019-12-18 16:30:36,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:30:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-18 16:30:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-18 16:30:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-18 16:30:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-18 16:30:37,658 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-18 16:30:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:37,658 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-18 16:30:37,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:30:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-18 16:30:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:30:37,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:37,684 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] [2019-12-18 16:30:37,685 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-18 16:30:37,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:37,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67743967] [2019-12-18 16:30:37,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:37,742 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:30:37,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67743967] [2019-12-18 16:30:37,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:37,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:37,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163034811] [2019-12-18 16:30:37,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:37,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:37,744 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 4 states. [2019-12-18 16:30:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:37,808 INFO L93 Difference]: Finished difference Result 13493 states and 41620 transitions. [2019-12-18 16:30:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:30:37,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:30:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:37,835 INFO L225 Difference]: With dead ends: 13493 [2019-12-18 16:30:37,835 INFO L226 Difference]: Without dead ends: 13493 [2019-12-18 16:30:37,836 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:30:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-18 16:30:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13273. [2019-12-18 16:30:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13273 states. [2019-12-18 16:30:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 40970 transitions. [2019-12-18 16:30:38,063 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 40970 transitions. Word has length 25 [2019-12-18 16:30:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:38,063 INFO L462 AbstractCegarLoop]: Abstraction has 13273 states and 40970 transitions. [2019-12-18 16:30:38,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 40970 transitions. [2019-12-18 16:30:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:30:38,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:38,089 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] [2019-12-18 16:30:38,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-18 16:30:38,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:38,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916484666] [2019-12-18 16:30:38,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:38,168 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:30:38,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916484666] [2019-12-18 16:30:38,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:38,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:30:38,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124533832] [2019-12-18 16:30:38,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:30:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:30:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:30:38,171 INFO L87 Difference]: Start difference. First operand 13273 states and 40970 transitions. Second operand 5 states. [2019-12-18 16:30:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:38,244 INFO L93 Difference]: Finished difference Result 12040 states and 37785 transitions. [2019-12-18 16:30:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:38,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 16:30:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:38,266 INFO L225 Difference]: With dead ends: 12040 [2019-12-18 16:30:38,266 INFO L226 Difference]: Without dead ends: 11998 [2019-12-18 16:30:38,266 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:30:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-12-18 16:30:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 11419. [2019-12-18 16:30:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-12-18 16:30:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 36001 transitions. [2019-12-18 16:30:38,447 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 36001 transitions. Word has length 39 [2019-12-18 16:30:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:38,447 INFO L462 AbstractCegarLoop]: Abstraction has 11419 states and 36001 transitions. [2019-12-18 16:30:38,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:30:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 36001 transitions. [2019-12-18 16:30:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:38,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:38,464 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] [2019-12-18 16:30:38,465 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-18 16:30:38,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:38,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376322818] [2019-12-18 16:30:38,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:38,547 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:30:38,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376322818] [2019-12-18 16:30:38,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:38,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:38,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475439910] [2019-12-18 16:30:38,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:38,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:38,549 INFO L87 Difference]: Start difference. First operand 11419 states and 36001 transitions. Second operand 4 states. [2019-12-18 16:30:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:38,627 INFO L93 Difference]: Finished difference Result 20766 states and 65459 transitions. [2019-12-18 16:30:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:30:38,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 16:30:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:38,643 INFO L225 Difference]: With dead ends: 20766 [2019-12-18 16:30:38,643 INFO L226 Difference]: Without dead ends: 9680 [2019-12-18 16:30:38,643 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:30:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2019-12-18 16:30:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9680. [2019-12-18 16:30:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2019-12-18 16:30:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 30383 transitions. [2019-12-18 16:30:38,789 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 30383 transitions. Word has length 53 [2019-12-18 16:30:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:38,790 INFO L462 AbstractCegarLoop]: Abstraction has 9680 states and 30383 transitions. [2019-12-18 16:30:38,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 30383 transitions. [2019-12-18 16:30:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:38,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:38,805 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] [2019-12-18 16:30:38,805 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-18 16:30:38,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:38,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789221995] [2019-12-18 16:30:38,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:38,912 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:30:38,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789221995] [2019-12-18 16:30:38,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:38,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:30:38,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384565054] [2019-12-18 16:30:38,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:30:38,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:30:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:30:38,914 INFO L87 Difference]: Start difference. First operand 9680 states and 30383 transitions. Second operand 7 states. [2019-12-18 16:30:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:39,401 INFO L93 Difference]: Finished difference Result 24579 states and 76915 transitions. [2019-12-18 16:30:39,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:30:39,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:30:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:39,432 INFO L225 Difference]: With dead ends: 24579 [2019-12-18 16:30:39,432 INFO L226 Difference]: Without dead ends: 19443 [2019-12-18 16:30:39,433 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:30:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-18 16:30:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 11624. [2019-12-18 16:30:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-12-18 16:30:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 36702 transitions. [2019-12-18 16:30:39,657 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 36702 transitions. Word has length 53 [2019-12-18 16:30:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:39,657 INFO L462 AbstractCegarLoop]: Abstraction has 11624 states and 36702 transitions. [2019-12-18 16:30:39,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:30:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 36702 transitions. [2019-12-18 16:30:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:39,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:39,676 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] [2019-12-18 16:30:39,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-18 16:30:39,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:39,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456712335] [2019-12-18 16:30:39,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:39,774 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:30:39,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456712335] [2019-12-18 16:30:39,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:39,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:30:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420038688] [2019-12-18 16:30:39,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:30:39,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:39,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:30:39,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:30:39,777 INFO L87 Difference]: Start difference. First operand 11624 states and 36702 transitions. Second operand 7 states. [2019-12-18 16:30:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:40,219 INFO L93 Difference]: Finished difference Result 29614 states and 91402 transitions. [2019-12-18 16:30:40,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:30:40,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:30:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:40,261 INFO L225 Difference]: With dead ends: 29614 [2019-12-18 16:30:40,262 INFO L226 Difference]: Without dead ends: 21210 [2019-12-18 16:30:40,262 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:30:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2019-12-18 16:30:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 13657. [2019-12-18 16:30:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-18 16:30:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 42965 transitions. [2019-12-18 16:30:40,537 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 42965 transitions. Word has length 53 [2019-12-18 16:30:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:40,537 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 42965 transitions. [2019-12-18 16:30:40,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:30:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 42965 transitions. [2019-12-18 16:30:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:40,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:40,557 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] [2019-12-18 16:30:40,557 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-18 16:30:40,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:40,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651304145] [2019-12-18 16:30:40,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:40,651 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:30:40,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651304145] [2019-12-18 16:30:40,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:40,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:30:40,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825205889] [2019-12-18 16:30:40,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:30:40,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:30:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:30:40,653 INFO L87 Difference]: Start difference. First operand 13657 states and 42965 transitions. Second operand 7 states. [2019-12-18 16:30:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:41,045 INFO L93 Difference]: Finished difference Result 27460 states and 85976 transitions. [2019-12-18 16:30:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:30:41,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:30:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:41,085 INFO L225 Difference]: With dead ends: 27460 [2019-12-18 16:30:41,085 INFO L226 Difference]: Without dead ends: 25402 [2019-12-18 16:30:41,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:30:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25402 states. [2019-12-18 16:30:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25402 to 13726. [2019-12-18 16:30:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13726 states. [2019-12-18 16:30:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 43266 transitions. [2019-12-18 16:30:41,381 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 43266 transitions. Word has length 53 [2019-12-18 16:30:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:41,382 INFO L462 AbstractCegarLoop]: Abstraction has 13726 states and 43266 transitions. [2019-12-18 16:30:41,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:30:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 43266 transitions. [2019-12-18 16:30:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:41,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:41,398 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] [2019-12-18 16:30:41,398 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-18 16:30:41,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:41,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571689418] [2019-12-18 16:30:41,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:41,444 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:30:41,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571689418] [2019-12-18 16:30:41,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:41,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:41,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421756505] [2019-12-18 16:30:41,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:41,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:41,447 INFO L87 Difference]: Start difference. First operand 13726 states and 43266 transitions. Second operand 3 states. [2019-12-18 16:30:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:41,562 INFO L93 Difference]: Finished difference Result 18812 states and 59147 transitions. [2019-12-18 16:30:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:41,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:30:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:41,600 INFO L225 Difference]: With dead ends: 18812 [2019-12-18 16:30:41,600 INFO L226 Difference]: Without dead ends: 18812 [2019-12-18 16:30:41,600 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:30:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18812 states. [2019-12-18 16:30:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18812 to 16902. [2019-12-18 16:30:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2019-12-18 16:30:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 53223 transitions. [2019-12-18 16:30:42,011 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 53223 transitions. Word has length 53 [2019-12-18 16:30:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:42,011 INFO L462 AbstractCegarLoop]: Abstraction has 16902 states and 53223 transitions. [2019-12-18 16:30:42,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 53223 transitions. [2019-12-18 16:30:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:42,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:42,035 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] [2019-12-18 16:30:42,035 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-18 16:30:42,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:42,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362240855] [2019-12-18 16:30:42,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:42,083 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:30:42,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362240855] [2019-12-18 16:30:42,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:42,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:42,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385883505] [2019-12-18 16:30:42,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:42,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:42,088 INFO L87 Difference]: Start difference. First operand 16902 states and 53223 transitions. Second operand 3 states. [2019-12-18 16:30:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:42,221 INFO L93 Difference]: Finished difference Result 18773 states and 56435 transitions. [2019-12-18 16:30:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:42,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:30:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:42,248 INFO L225 Difference]: With dead ends: 18773 [2019-12-18 16:30:42,248 INFO L226 Difference]: Without dead ends: 18104 [2019-12-18 16:30:42,249 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:30:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-18 16:30:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 15749. [2019-12-18 16:30:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-18 16:30:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-18 16:30:42,496 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-18 16:30:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:42,496 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-18 16:30:42,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-18 16:30:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:42,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:42,518 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] [2019-12-18 16:30:42,518 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-18 16:30:42,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:42,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086918114] [2019-12-18 16:30:42,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:42,630 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:30:42,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086918114] [2019-12-18 16:30:42,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:42,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:30:42,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439376817] [2019-12-18 16:30:42,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:30:42,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:30:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:30:42,636 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 7 states. [2019-12-18 16:30:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:43,561 INFO L93 Difference]: Finished difference Result 26751 states and 78312 transitions. [2019-12-18 16:30:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:30:43,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:30:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:43,600 INFO L225 Difference]: With dead ends: 26751 [2019-12-18 16:30:43,601 INFO L226 Difference]: Without dead ends: 26641 [2019-12-18 16:30:43,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:30:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-12-18 16:30:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 19681. [2019-12-18 16:30:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-18 16:30:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-18 16:30:43,980 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-18 16:30:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:43,981 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-18 16:30:43,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:30:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-18 16:30:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:44,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:44,005 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] [2019-12-18 16:30:44,006 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:44,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-18 16:30:44,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:44,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004350656] [2019-12-18 16:30:44,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:44,146 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:30:44,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004350656] [2019-12-18 16:30:44,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:44,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:30:44,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807713283] [2019-12-18 16:30:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:30:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:30:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:30:44,148 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 8 states. [2019-12-18 16:30:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:45,679 INFO L93 Difference]: Finished difference Result 38250 states and 112084 transitions. [2019-12-18 16:30:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:30:45,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 16:30:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:45,735 INFO L225 Difference]: With dead ends: 38250 [2019-12-18 16:30:45,735 INFO L226 Difference]: Without dead ends: 38140 [2019-12-18 16:30:45,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:30:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2019-12-18 16:30:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 20676. [2019-12-18 16:30:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20676 states. [2019-12-18 16:30:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20676 states to 20676 states and 61780 transitions. [2019-12-18 16:30:46,198 INFO L78 Accepts]: Start accepts. Automaton has 20676 states and 61780 transitions. Word has length 53 [2019-12-18 16:30:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:46,199 INFO L462 AbstractCegarLoop]: Abstraction has 20676 states and 61780 transitions. [2019-12-18 16:30:46,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:30:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20676 states and 61780 transitions. [2019-12-18 16:30:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:30:46,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:46,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:46,224 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-18 16:30:46,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:46,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519872824] [2019-12-18 16:30:46,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:46,297 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:30:46,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519872824] [2019-12-18 16:30:46,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:46,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:46,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431206678] [2019-12-18 16:30:46,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:46,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:46,299 INFO L87 Difference]: Start difference. First operand 20676 states and 61780 transitions. Second operand 3 states. [2019-12-18 16:30:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:46,386 INFO L93 Difference]: Finished difference Result 20676 states and 61778 transitions. [2019-12-18 16:30:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:46,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:30:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:46,421 INFO L225 Difference]: With dead ends: 20676 [2019-12-18 16:30:46,421 INFO L226 Difference]: Without dead ends: 20676 [2019-12-18 16:30:46,421 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:30:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2019-12-18 16:30:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 16261. [2019-12-18 16:30:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-12-18 16:30:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 49687 transitions. [2019-12-18 16:30:46,723 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 49687 transitions. Word has length 53 [2019-12-18 16:30:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:46,723 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 49687 transitions. [2019-12-18 16:30:46,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 49687 transitions. [2019-12-18 16:30:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:30:46,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:46,743 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] [2019-12-18 16:30:46,743 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -6191814, now seen corresponding path program 1 times [2019-12-18 16:30:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:46,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011055786] [2019-12-18 16:30:46,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:46,804 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:30:46,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011055786] [2019-12-18 16:30:46,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:46,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:46,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875947921] [2019-12-18 16:30:46,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:46,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:46,807 INFO L87 Difference]: Start difference. First operand 16261 states and 49687 transitions. Second operand 3 states. [2019-12-18 16:30:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:46,867 INFO L93 Difference]: Finished difference Result 12476 states and 37450 transitions. [2019-12-18 16:30:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:46,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:30:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:46,884 INFO L225 Difference]: With dead ends: 12476 [2019-12-18 16:30:46,884 INFO L226 Difference]: Without dead ends: 12476 [2019-12-18 16:30:46,885 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:30:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2019-12-18 16:30:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 11767. [2019-12-18 16:30:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11767 states. [2019-12-18 16:30:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11767 states to 11767 states and 35347 transitions. [2019-12-18 16:30:47,071 INFO L78 Accepts]: Start accepts. Automaton has 11767 states and 35347 transitions. Word has length 54 [2019-12-18 16:30:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:47,071 INFO L462 AbstractCegarLoop]: Abstraction has 11767 states and 35347 transitions. [2019-12-18 16:30:47,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11767 states and 35347 transitions. [2019-12-18 16:30:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:47,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:47,085 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] [2019-12-18 16:30:47,085 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 1 times [2019-12-18 16:30:47,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:47,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056652687] [2019-12-18 16:30:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:47,205 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:30:47,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056652687] [2019-12-18 16:30:47,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:47,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:30:47,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424682022] [2019-12-18 16:30:47,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:30:47,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:30:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:30:47,211 INFO L87 Difference]: Start difference. First operand 11767 states and 35347 transitions. Second operand 8 states. [2019-12-18 16:30:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:48,416 INFO L93 Difference]: Finished difference Result 22675 states and 67447 transitions. [2019-12-18 16:30:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:30:48,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 16:30:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:48,441 INFO L225 Difference]: With dead ends: 22675 [2019-12-18 16:30:48,441 INFO L226 Difference]: Without dead ends: 18316 [2019-12-18 16:30:48,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:30:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18316 states. [2019-12-18 16:30:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18316 to 12308. [2019-12-18 16:30:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-18 16:30:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 36615 transitions. [2019-12-18 16:30:48,660 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 36615 transitions. Word has length 55 [2019-12-18 16:30:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:48,660 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 36615 transitions. [2019-12-18 16:30:48,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:30:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 36615 transitions. [2019-12-18 16:30:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:48,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:48,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] [2019-12-18 16:30:48,673 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 2 times [2019-12-18 16:30:48,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:48,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127699084] [2019-12-18 16:30:48,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:48,787 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:30:48,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127699084] [2019-12-18 16:30:48,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:48,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:30:48,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051996197] [2019-12-18 16:30:48,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:30:48,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:30:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:30:48,789 INFO L87 Difference]: Start difference. First operand 12308 states and 36615 transitions. Second operand 9 states. [2019-12-18 16:30:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:49,774 INFO L93 Difference]: Finished difference Result 21113 states and 62320 transitions. [2019-12-18 16:30:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:30:49,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 16:30:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:49,800 INFO L225 Difference]: With dead ends: 21113 [2019-12-18 16:30:49,800 INFO L226 Difference]: Without dead ends: 17884 [2019-12-18 16:30:49,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:30:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-12-18 16:30:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 12140. [2019-12-18 16:30:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12140 states. [2019-12-18 16:30:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12140 states to 12140 states and 36091 transitions. [2019-12-18 16:30:50,018 INFO L78 Accepts]: Start accepts. Automaton has 12140 states and 36091 transitions. Word has length 55 [2019-12-18 16:30:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:50,018 INFO L462 AbstractCegarLoop]: Abstraction has 12140 states and 36091 transitions. [2019-12-18 16:30:50,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:30:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12140 states and 36091 transitions. [2019-12-18 16:30:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:50,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:50,037 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] [2019-12-18 16:30:50,038 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 3 times [2019-12-18 16:30:50,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:50,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879946929] [2019-12-18 16:30:50,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:50,473 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:30:50,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879946929] [2019-12-18 16:30:50,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:50,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:30:50,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892207517] [2019-12-18 16:30:50,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:30:50,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:30:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:30:50,476 INFO L87 Difference]: Start difference. First operand 12140 states and 36091 transitions. Second operand 16 states. [2019-12-18 16:30:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:53,886 INFO L93 Difference]: Finished difference Result 21713 states and 62906 transitions. [2019-12-18 16:30:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 16:30:53,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 16:30:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:53,910 INFO L225 Difference]: With dead ends: 21713 [2019-12-18 16:30:53,910 INFO L226 Difference]: Without dead ends: 19315 [2019-12-18 16:30:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=413, Invalid=1939, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 16:30:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19315 states. [2019-12-18 16:30:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19315 to 12746. [2019-12-18 16:30:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12746 states. [2019-12-18 16:30:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12746 states to 12746 states and 37585 transitions. [2019-12-18 16:30:54,123 INFO L78 Accepts]: Start accepts. Automaton has 12746 states and 37585 transitions. Word has length 55 [2019-12-18 16:30:54,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:54,123 INFO L462 AbstractCegarLoop]: Abstraction has 12746 states and 37585 transitions. [2019-12-18 16:30:54,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:30:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 12746 states and 37585 transitions. [2019-12-18 16:30:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:54,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:54,136 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] [2019-12-18 16:30:54,136 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 4 times [2019-12-18 16:30:54,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:54,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725936985] [2019-12-18 16:30:54,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:54,294 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:30:54,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725936985] [2019-12-18 16:30:54,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:54,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:30:54,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97995642] [2019-12-18 16:30:54,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:30:54,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:30:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:30:54,296 INFO L87 Difference]: Start difference. First operand 12746 states and 37585 transitions. Second operand 11 states. [2019-12-18 16:30:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:55,296 INFO L93 Difference]: Finished difference Result 22254 states and 65466 transitions. [2019-12-18 16:30:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:30:55,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:30:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:55,326 INFO L225 Difference]: With dead ends: 22254 [2019-12-18 16:30:55,326 INFO L226 Difference]: Without dead ends: 21688 [2019-12-18 16:30:55,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:30:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21688 states. [2019-12-18 16:30:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21688 to 14270. [2019-12-18 16:30:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14270 states. [2019-12-18 16:30:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14270 states to 14270 states and 41926 transitions. [2019-12-18 16:30:55,610 INFO L78 Accepts]: Start accepts. Automaton has 14270 states and 41926 transitions. Word has length 55 [2019-12-18 16:30:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:55,610 INFO L462 AbstractCegarLoop]: Abstraction has 14270 states and 41926 transitions. [2019-12-18 16:30:55,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:30:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14270 states and 41926 transitions. [2019-12-18 16:30:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:55,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:55,627 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] [2019-12-18 16:30:55,627 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1314029809, now seen corresponding path program 5 times [2019-12-18 16:30:55,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:55,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136261234] [2019-12-18 16:30:55,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:56,176 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:30:56,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136261234] [2019-12-18 16:30:56,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:56,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 16:30:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900987186] [2019-12-18 16:30:56,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 16:30:56,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 16:30:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:30:56,178 INFO L87 Difference]: Start difference. First operand 14270 states and 41926 transitions. Second operand 19 states. [2019-12-18 16:30:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:59,484 INFO L93 Difference]: Finished difference Result 22345 states and 64550 transitions. [2019-12-18 16:30:59,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 16:30:59,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-18 16:30:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:59,511 INFO L225 Difference]: With dead ends: 22345 [2019-12-18 16:30:59,512 INFO L226 Difference]: Without dead ends: 21191 [2019-12-18 16:30:59,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 16:30:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21191 states. [2019-12-18 16:30:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21191 to 14282. [2019-12-18 16:30:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14282 states. [2019-12-18 16:30:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 41946 transitions. [2019-12-18 16:30:59,750 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 41946 transitions. Word has length 55 [2019-12-18 16:30:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:59,750 INFO L462 AbstractCegarLoop]: Abstraction has 14282 states and 41946 transitions. [2019-12-18 16:30:59,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 16:30:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 41946 transitions. [2019-12-18 16:30:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:30:59,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:59,765 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] [2019-12-18 16:30:59,765 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2101751141, now seen corresponding path program 6 times [2019-12-18 16:30:59,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:59,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239261863] [2019-12-18 16:30:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:00,130 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:31:00,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239261863] [2019-12-18 16:31:00,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:00,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:31:00,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185618858] [2019-12-18 16:31:00,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:31:00,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:31:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:31:00,132 INFO L87 Difference]: Start difference. First operand 14282 states and 41946 transitions. Second operand 16 states. [2019-12-18 16:31:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:03,875 INFO L93 Difference]: Finished difference Result 27378 states and 78849 transitions. [2019-12-18 16:31:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 16:31:03,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 16:31:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:03,908 INFO L225 Difference]: With dead ends: 27378 [2019-12-18 16:31:03,908 INFO L226 Difference]: Without dead ends: 23482 [2019-12-18 16:31:03,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=493, Invalid=2369, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 16:31:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23482 states. [2019-12-18 16:31:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23482 to 13493. [2019-12-18 16:31:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-12-18 16:31:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 39876 transitions. [2019-12-18 16:31:04,184 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 39876 transitions. Word has length 55 [2019-12-18 16:31:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:04,184 INFO L462 AbstractCegarLoop]: Abstraction has 13493 states and 39876 transitions. [2019-12-18 16:31:04,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:31:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 39876 transitions. [2019-12-18 16:31:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:04,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:04,199 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] [2019-12-18 16:31:04,199 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 7 times [2019-12-18 16:31:04,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:04,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766650085] [2019-12-18 16:31:04,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:04,514 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:31:04,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766650085] [2019-12-18 16:31:04,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:04,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:31:04,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351897474] [2019-12-18 16:31:04,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:31:04,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:04,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:31:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:31:04,516 INFO L87 Difference]: Start difference. First operand 13493 states and 39876 transitions. Second operand 12 states. [2019-12-18 16:31:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:05,491 INFO L93 Difference]: Finished difference Result 21138 states and 61941 transitions. [2019-12-18 16:31:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:31:05,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 16:31:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:05,517 INFO L225 Difference]: With dead ends: 21138 [2019-12-18 16:31:05,517 INFO L226 Difference]: Without dead ends: 18069 [2019-12-18 16:31:05,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:31:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18069 states. [2019-12-18 16:31:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18069 to 11486. [2019-12-18 16:31:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11486 states. [2019-12-18 16:31:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34223 transitions. [2019-12-18 16:31:05,734 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34223 transitions. Word has length 55 [2019-12-18 16:31:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:05,734 INFO L462 AbstractCegarLoop]: Abstraction has 11486 states and 34223 transitions. [2019-12-18 16:31:05,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:31:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34223 transitions. [2019-12-18 16:31:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:05,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:05,747 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] [2019-12-18 16:31:05,748 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 8 times [2019-12-18 16:31:05,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:05,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403063666] [2019-12-18 16:31:05,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:31:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:31:05,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:31:05,852 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:31:05,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40| 1)) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40|) |v_ULTIMATE.start_main_~#t412~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= |v_ULTIMATE.start_main_~#t412~0.offset_28| 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40|) 0) (= |v_#NULL.offset_4| 0) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t412~0.base_40|) (= v_~__unbuffered_p2_EBX~0_40 0) (= v_~x$r_buff1_thd0~0_274 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t412~0.base_40| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t412~0.offset=|v_ULTIMATE.start_main_~#t412~0.offset_28|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ULTIMATE.start_main_~#t412~0.base=|v_ULTIMATE.start_main_~#t412~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t414~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_~#t412~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t412~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t413~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t414~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t413~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 16:31:05,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11|) |v_ULTIMATE.start_main_~#t413~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t413~0.offset_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t413~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t413~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_11|, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t413~0.base, ULTIMATE.start_main_~#t413~0.offset] because there is no mapped edge [2019-12-18 16:31:05,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 16:31:05,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t414~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t414~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11|) |v_ULTIMATE.start_main_~#t414~0.offset_10| 2))) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11| 1) |v_#valid_33|) (not (= |v_ULTIMATE.start_main_~#t414~0.base_11| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t414~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t414~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t414~0.offset] because there is no mapped edge [2019-12-18 16:31:05,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1381393592 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1381393592 256)))) (or (and (= ~x$w_buff1~0_In1381393592 |P2Thread1of1ForFork1_#t~ite32_Out1381393592|) (not .cse0) (not .cse1)) (and (= ~x~0_In1381393592 |P2Thread1of1ForFork1_#t~ite32_Out1381393592|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1381393592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1381393592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1381393592, ~x~0=~x~0_In1381393592} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1381393592|, ~x$w_buff1~0=~x$w_buff1~0_In1381393592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1381393592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1381393592, ~x~0=~x~0_In1381393592} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 16:31:05,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1637739052 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1637739052 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1637739052| ~x$w_buff0_used~0_In1637739052)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1637739052| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1637739052, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637739052} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1637739052, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1637739052|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637739052} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 16:31:05,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In393633429 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In393633429 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In393633429 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In393633429 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out393633429|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In393633429 |P1Thread1of1ForFork0_#t~ite29_Out393633429|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In393633429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In393633429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In393633429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In393633429} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In393633429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In393633429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In393633429, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out393633429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In393633429} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:31:05,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1767868092 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1767868092 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out1767868092 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out1767868092 ~x$r_buff0_thd2~0_In1767868092)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1767868092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767868092} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1767868092|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1767868092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767868092} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:31:05,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1165040031 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1165040031 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1165040031 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1165040031 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1165040031| ~x$r_buff1_thd2~0_In-1165040031) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1165040031| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1165040031, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1165040031, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165040031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165040031} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1165040031|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1165040031, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1165040031, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165040031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165040031} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:31:05,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 16:31:05,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1859200370 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1859200370 |P0Thread1of1ForFork2_#t~ite15_Out-1859200370|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-1859200370| |P0Thread1of1ForFork2_#t~ite14_Out-1859200370|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1859200370| |P0Thread1of1ForFork2_#t~ite14_Out-1859200370|) (= ~x$w_buff0_used~0_In-1859200370 |P0Thread1of1ForFork2_#t~ite14_Out-1859200370|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1859200370 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1859200370 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1859200370 256)) (and (= (mod ~x$w_buff1_used~0_In-1859200370 256) 0) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1859200370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1859200370, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1859200370, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1859200370|, ~weak$$choice2~0=~weak$$choice2~0_In-1859200370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1859200370} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1859200370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1859200370, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1859200370|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1859200370, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1859200370|, ~weak$$choice2~0=~weak$$choice2~0_In-1859200370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1859200370} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:31:05,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-421363050 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-421363050 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-421363050 256) 0)) (.cse4 (= |P0Thread1of1ForFork2_#t~ite17_Out-421363050| |P0Thread1of1ForFork2_#t~ite18_Out-421363050|)) (.cse5 (= (mod ~weak$$choice2~0_In-421363050 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-421363050 256) 0))) (or (and (or (and (= ~x$w_buff1_used~0_In-421363050 |P0Thread1of1ForFork2_#t~ite17_Out-421363050|) (or .cse0 (and .cse1 .cse2) (and .cse3 .cse2)) .cse4 .cse5) (and (= ~x$w_buff1_used~0_In-421363050 |P0Thread1of1ForFork2_#t~ite18_Out-421363050|) (= |P0Thread1of1ForFork2_#t~ite17_Out-421363050| |P0Thread1of1ForFork2_#t~ite17_In-421363050|) (not .cse5))) (= |P0Thread1of1ForFork2_#t~ite16_In-421363050| |P0Thread1of1ForFork2_#t~ite16_Out-421363050|)) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) (or (not .cse1) .cse6) (= |P0Thread1of1ForFork2_#t~ite17_Out-421363050| |P0Thread1of1ForFork2_#t~ite16_Out-421363050|) (not .cse0) .cse4 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out-421363050|) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-421363050, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-421363050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-421363050, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-421363050|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-421363050, ~weak$$choice2~0=~weak$$choice2~0_In-421363050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-421363050} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-421363050, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-421363050|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-421363050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-421363050, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-421363050|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-421363050, ~weak$$choice2~0=~weak$$choice2~0_In-421363050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-421363050} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 16:31:05,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:31:05,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 16:31:05,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 16:31:05,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1846645009 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1846645009 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1846645009| ~x$w_buff0_used~0_In1846645009)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1846645009| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1846645009, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1846645009} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1846645009|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1846645009, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1846645009} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:31:05,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1469560877 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1469560877 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1469560877 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1469560877 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1469560877| 0)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1469560877 |P2Thread1of1ForFork1_#t~ite35_Out1469560877|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1469560877, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1469560877, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1469560877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469560877} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1469560877|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469560877, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1469560877, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1469560877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469560877} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:31:05,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1512731902 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1512731902 256)))) (or (and (= ~x$r_buff0_thd3~0_In-1512731902 |P2Thread1of1ForFork1_#t~ite36_Out-1512731902|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1512731902|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1512731902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1512731902} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1512731902|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1512731902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1512731902} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:31:05,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-871560536 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-871560536 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-871560536 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-871560536 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-871560536| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-871560536| ~x$r_buff1_thd3~0_In-871560536)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-871560536, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-871560536, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-871560536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871560536} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-871560536|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-871560536, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-871560536, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-871560536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871560536} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:31:05,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 16:31:05,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:31:05,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In2128435325 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out2128435325| |ULTIMATE.start_main_#t~ite42_Out2128435325|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2128435325 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out2128435325| ~x~0_In2128435325) .cse2) (and (not .cse0) .cse2 (not .cse1) (= ~x$w_buff1~0_In2128435325 |ULTIMATE.start_main_#t~ite41_Out2128435325|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2128435325, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128435325, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2128435325, ~x~0=~x~0_In2128435325} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2128435325|, ~x$w_buff1~0=~x$w_buff1~0_In2128435325, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128435325, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2128435325, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2128435325|, ~x~0=~x~0_In2128435325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:31:05,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1354304068 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1354304068 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out1354304068|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1354304068 |ULTIMATE.start_main_#t~ite43_Out1354304068|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1354304068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1354304068} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1354304068, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1354304068|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1354304068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:31:05,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1984257085 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1984257085 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1984257085 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1984257085 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1984257085| ~x$w_buff1_used~0_In-1984257085) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite44_Out-1984257085| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1984257085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1984257085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1984257085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1984257085} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1984257085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1984257085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1984257085, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1984257085|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1984257085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:31:05,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1943987922 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1943987922 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1943987922| ~x$r_buff0_thd0~0_In1943987922)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1943987922| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1943987922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1943987922} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1943987922, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1943987922|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1943987922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:31:05,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-535263072 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-535263072 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-535263072 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-535263072 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-535263072 |ULTIMATE.start_main_#t~ite46_Out-535263072|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-535263072|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-535263072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-535263072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-535263072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-535263072} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-535263072, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-535263072|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-535263072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-535263072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-535263072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:31:05,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:31:05,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:31:05 BasicIcfg [2019-12-18 16:31:05,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:31:05,975 INFO L168 Benchmark]: Toolchain (without parser) took 68689.69 ms. Allocated memory was 145.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,975 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.34 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,982 INFO L168 Benchmark]: Boogie Preprocessor took 37.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,982 INFO L168 Benchmark]: RCFGBuilder took 810.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 104.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,983 INFO L168 Benchmark]: TraceAbstraction took 66936.29 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:31:05,989 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.34 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.39 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 104.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66936.29 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 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.1s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5314 SDtfs, 6977 SDslu, 20125 SDs, 0 SdLazy, 14830 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 40 SyntacticMatches, 14 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 138300 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1102 NumberOfCodeBlocks, 1102 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 212021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...