/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:24:48,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:24:48,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:24:48,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:24:48,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:24:48,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:24:48,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:24:48,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:24:48,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:24:48,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:24:48,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:24:48,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:24:48,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:24:48,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:24:48,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:24:48,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:24:48,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:24:48,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:24:48,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:24:48,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:24:48,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:24:48,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:24:48,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:24:48,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:24:48,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:24:48,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:24:48,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:24:48,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:24:48,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:24:48,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:24:48,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:24:48,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:24:48,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:24:48,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:24:48,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:24:48,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:24:48,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:24:48,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:24:48,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:24:48,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:24:48,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:24:48,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:24:48,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:24:48,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:24:48,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:24:48,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:24:48,123 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:24:48,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:24:48,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:24:48,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:24:48,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:24:48,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:24:48,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:24:48,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:24:48,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:24:48,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:24:48,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:24:48,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:24:48,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:24:48,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:24:48,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:24:48,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:24:48,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:24:48,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:24:48,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:24:48,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:24:48,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:24:48,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:24:48,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:24:48,128 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:24:48,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:24:48,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:24:48,128 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:24:48,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:24:48,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:24:48,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:24:48,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:24:48,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:24:48,403 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:24:48,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2019-12-27 21:24:48,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87792af6e/4f6a553f3ce54cb6ad03b7c8553b1ad6/FLAGfebdd9e7b [2019-12-27 21:24:49,099 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:24:49,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2019-12-27 21:24:49,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87792af6e/4f6a553f3ce54cb6ad03b7c8553b1ad6/FLAGfebdd9e7b [2019-12-27 21:24:49,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87792af6e/4f6a553f3ce54cb6ad03b7c8553b1ad6 [2019-12-27 21:24:49,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:24:49,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:24:49,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:24:49,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:24:49,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:24:49,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:24:49" (1/1) ... [2019-12-27 21:24:49,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c762407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:49, skipping insertion in model container [2019-12-27 21:24:49,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:24:49" (1/1) ... [2019-12-27 21:24:49,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:24:49,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:24:50,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:24:50,027 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:24:50,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:24:50,187 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:24:50,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50 WrapperNode [2019-12-27 21:24:50,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:24:50,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:24:50,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:24:50,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:24:50,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:24:50,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:24:50,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:24:50,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:24:50,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... [2019-12-27 21:24:50,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:24:50,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:24:50,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:24:50,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:24:50,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:24:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:24:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:24:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:24:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:24:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:24:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:24:50,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:24:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:24:50,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:24:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:24:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:24:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:24:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:24:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:24:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:24:50,395 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:24:51,178 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:24:51,179 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:24:51,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:24:51 BoogieIcfgContainer [2019-12-27 21:24:51,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:24:51,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:24:51,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:24:51,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:24:51,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:24:49" (1/3) ... [2019-12-27 21:24:51,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2c402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:24:51, skipping insertion in model container [2019-12-27 21:24:51,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:50" (2/3) ... [2019-12-27 21:24:51,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2c402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:24:51, skipping insertion in model container [2019-12-27 21:24:51,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:24:51" (3/3) ... [2019-12-27 21:24:51,189 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2019-12-27 21:24:51,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:24:51,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:24:51,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:24:51,208 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:24:51,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,275 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,275 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,286 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,303 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,305 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,306 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,307 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:51,323 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:24:51,346 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:24:51,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:24:51,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:24:51,347 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:24:51,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:24:51,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:24:51,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:24:51,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:24:51,372 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 21:24:51,374 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:24:51,483 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:24:51,483 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:24:51,498 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:24:51,519 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:24:51,571 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:24:51,571 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:24:51,577 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:24:51,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:24:51,595 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:24:55,059 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 21:24:55,199 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 21:24:55,244 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-27 21:24:55,245 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:24:55,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 21:24:58,423 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-27 21:24:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-27 21:24:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:24:58,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:58,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:58,434 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-27 21:24:58,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:58,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278295416] [2019-12-27 21:24:58,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:58,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278295416] [2019-12-27 21:24:58,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:58,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:24:58,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072410621] [2019-12-27 21:24:58,729 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:58,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:58,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:24:58,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:58,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:58,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:58,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:58,772 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-27 21:24:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:59,414 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-27 21:24:59,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:59,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:24:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:59,973 INFO L225 Difference]: With dead ends: 36046 [2019-12-27 21:24:59,973 INFO L226 Difference]: Without dead ends: 35318 [2019-12-27 21:24:59,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-27 21:25:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-27 21:25:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-27 21:25:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-27 21:25:03,820 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-27 21:25:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:03,821 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-27 21:25:03,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-27 21:25:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:25:03,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:03,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:03,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-27 21:25:03,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:03,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223059872] [2019-12-27 21:25:03,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:03,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223059872] [2019-12-27 21:25:03,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:03,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:03,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291301651] [2019-12-27 21:25:03,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:03,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:03,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:25:03,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:03,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:25:03,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:03,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:03,997 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 5 states. [2019-12-27 21:25:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:04,686 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-27 21:25:04,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:25:04,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:25:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:05,587 INFO L225 Difference]: With dead ends: 54990 [2019-12-27 21:25:05,588 INFO L226 Difference]: Without dead ends: 54962 [2019-12-27 21:25:05,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-27 21:25:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-27 21:25:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-27 21:25:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-27 21:25:07,622 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-27 21:25:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:07,622 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-27 21:25:07,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-27 21:25:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:25:07,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:07,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:07,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-27 21:25:07,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:07,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814646589] [2019-12-27 21:25:07,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:07,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814646589] [2019-12-27 21:25:07,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:07,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:07,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227004397] [2019-12-27 21:25:07,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:07,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:07,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:25:07,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:07,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:07,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:07,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:07,718 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-27 21:25:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:09,713 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-27 21:25:09,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:09,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:25:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:09,835 INFO L225 Difference]: With dead ends: 39218 [2019-12-27 21:25:09,835 INFO L226 Difference]: Without dead ends: 39218 [2019-12-27 21:25:09,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-27 21:25:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-27 21:25:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-27 21:25:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-27 21:25:10,954 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-27 21:25:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:10,954 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-27 21:25:10,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-27 21:25:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:25:10,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:10,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:10,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-27 21:25:10,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:10,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863048144] [2019-12-27 21:25:10,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863048144] [2019-12-27 21:25:11,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:11,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255378857] [2019-12-27 21:25:11,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:11,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:11,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:25:11,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:11,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:25:11,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:11,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:11,045 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 5 states. [2019-12-27 21:25:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:11,134 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-27 21:25:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:25:11,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:25:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:11,161 INFO L225 Difference]: With dead ends: 16304 [2019-12-27 21:25:11,161 INFO L226 Difference]: Without dead ends: 16304 [2019-12-27 21:25:11,161 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-27 21:25:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-27 21:25:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-27 21:25:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-27 21:25:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-27 21:25:11,529 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-27 21:25:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:11,530 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-27 21:25:11,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-27 21:25:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:25:11,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:11,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:11,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-27 21:25:11,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:11,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137856323] [2019-12-27 21:25:11,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:11,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137856323] [2019-12-27 21:25:11,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:11,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:11,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197863230] [2019-12-27 21:25:11,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:11,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:11,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:25:11,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:11,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:25:11,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:11,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:11,629 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 6 states. [2019-12-27 21:25:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:11,687 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-27 21:25:11,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:25:11,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:25:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:11,692 INFO L225 Difference]: With dead ends: 2786 [2019-12-27 21:25:11,693 INFO L226 Difference]: Without dead ends: 2786 [2019-12-27 21:25:11,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-27 21:25:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-27 21:25:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-27 21:25:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-27 21:25:11,738 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-27 21:25:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:11,740 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-27 21:25:11,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-27 21:25:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:25:11,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:11,745 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] [2019-12-27 21:25:11,745 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-27 21:25:11,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:11,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635317364] [2019-12-27 21:25:11,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:11,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635317364] [2019-12-27 21:25:11,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:11,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:25:11,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087047532] [2019-12-27 21:25:11,960 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:11,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:12,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:25:12,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:12,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:25:12,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:25:12,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:25:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:25:12,053 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 8 states. [2019-12-27 21:25:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:12,108 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-27 21:25:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:12,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:25:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:12,111 INFO L225 Difference]: With dead ends: 1356 [2019-12-27 21:25:12,112 INFO L226 Difference]: Without dead ends: 1356 [2019-12-27 21:25:12,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:25:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-27 21:25:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-27 21:25:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 21:25:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-27 21:25:12,137 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-27 21:25:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:12,137 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-27 21:25:12,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:25:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-27 21:25:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:25:12,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:12,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:12,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-27 21:25:12,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:12,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477839365] [2019-12-27 21:25:12,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:12,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477839365] [2019-12-27 21:25:12,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:12,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:12,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088954201] [2019-12-27 21:25:12,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:12,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:12,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:25:12,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:12,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:12,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:12,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:12,355 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-27 21:25:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:12,396 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-27 21:25:12,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:12,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:25:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:12,399 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 21:25:12,399 INFO L226 Difference]: Without dead ends: 1224 [2019-12-27 21:25:12,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-27 21:25:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-27 21:25:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-27 21:25:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-27 21:25:12,414 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-27 21:25:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:12,414 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-27 21:25:12,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-27 21:25:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:25:12,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:12,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:12,419 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-27 21:25:12,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:12,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042878345] [2019-12-27 21:25:12,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:12,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042878345] [2019-12-27 21:25:12,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:12,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:25:12,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10843149] [2019-12-27 21:25:12,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:12,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:12,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:25:12,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:12,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:25:12,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:12,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:12,628 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-27 21:25:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:12,871 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-27 21:25:12,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:12,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:25:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:12,875 INFO L225 Difference]: With dead ends: 1760 [2019-12-27 21:25:12,876 INFO L226 Difference]: Without dead ends: 1760 [2019-12-27 21:25:12,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-27 21:25:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-27 21:25:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-27 21:25:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-27 21:25:12,894 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-27 21:25:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:12,895 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-27 21:25:12,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-27 21:25:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:25:12,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:12,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:12,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-27 21:25:12,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:12,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557539961] [2019-12-27 21:25:12,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557539961] [2019-12-27 21:25:13,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:13,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:13,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060478943] [2019-12-27 21:25:13,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:13,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:13,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 231 transitions. [2019-12-27 21:25:13,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:13,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:25:13,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:25:13,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:25:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:25:13,338 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 10 states. [2019-12-27 21:25:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:14,701 INFO L93 Difference]: Finished difference Result 3057 states and 8420 transitions. [2019-12-27 21:25:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:25:14,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:25:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:14,707 INFO L225 Difference]: With dead ends: 3057 [2019-12-27 21:25:14,707 INFO L226 Difference]: Without dead ends: 3057 [2019-12-27 21:25:14,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:25:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2019-12-27 21:25:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 1499. [2019-12-27 21:25:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-27 21:25:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-27 21:25:14,739 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-27 21:25:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:14,739 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-27 21:25:14,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:25:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-27 21:25:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:25:14,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:14,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, 1, 1, 1, 1] [2019-12-27 21:25:14,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-27 21:25:14,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:14,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183914098] [2019-12-27 21:25:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:14,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183914098] [2019-12-27 21:25:14,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:14,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:14,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643248544] [2019-12-27 21:25:14,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:14,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:15,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 204 transitions. [2019-12-27 21:25:15,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:15,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:25:15,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:15,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:15,011 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 6 states. [2019-12-27 21:25:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:15,364 INFO L93 Difference]: Finished difference Result 2373 states and 6750 transitions. [2019-12-27 21:25:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:25:15,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:25:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:15,369 INFO L225 Difference]: With dead ends: 2373 [2019-12-27 21:25:15,370 INFO L226 Difference]: Without dead ends: 2373 [2019-12-27 21:25:15,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:25:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-12-27 21:25:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1687. [2019-12-27 21:25:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-27 21:25:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4858 transitions. [2019-12-27 21:25:15,405 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4858 transitions. Word has length 58 [2019-12-27 21:25:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:15,406 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 4858 transitions. [2019-12-27 21:25:15,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4858 transitions. [2019-12-27 21:25:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:25:15,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:15,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:15,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1959735343, now seen corresponding path program 4 times [2019-12-27 21:25:15,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:15,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458324614] [2019-12-27 21:25:15,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:15,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458324614] [2019-12-27 21:25:15,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:15,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:25:15,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094796021] [2019-12-27 21:25:15,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:15,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:15,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 21:25:15,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:15,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:25:15,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:25:15,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:25:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:25:15,811 INFO L87 Difference]: Start difference. First operand 1687 states and 4858 transitions. Second operand 11 states. [2019-12-27 21:25:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:17,155 INFO L93 Difference]: Finished difference Result 3418 states and 9410 transitions. [2019-12-27 21:25:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:25:17,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:25:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:17,166 INFO L225 Difference]: With dead ends: 3418 [2019-12-27 21:25:17,166 INFO L226 Difference]: Without dead ends: 3418 [2019-12-27 21:25:17,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:25:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2019-12-27 21:25:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1603. [2019-12-27 21:25:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-27 21:25:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4610 transitions. [2019-12-27 21:25:17,215 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 4610 transitions. Word has length 58 [2019-12-27 21:25:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:17,216 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 4610 transitions. [2019-12-27 21:25:17,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:25:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 4610 transitions. [2019-12-27 21:25:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:25:17,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:17,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:17,221 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1379010492, now seen corresponding path program 1 times [2019-12-27 21:25:17,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:17,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649562277] [2019-12-27 21:25:17,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:17,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649562277] [2019-12-27 21:25:17,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:17,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:17,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849813396] [2019-12-27 21:25:17,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:17,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:17,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 179 transitions. [2019-12-27 21:25:17,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:17,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:17,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:17,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:17,499 INFO L87 Difference]: Start difference. First operand 1603 states and 4610 transitions. Second operand 3 states. [2019-12-27 21:25:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:17,545 INFO L93 Difference]: Finished difference Result 1603 states and 4609 transitions. [2019-12-27 21:25:17,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:17,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:25:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:17,548 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 21:25:17,548 INFO L226 Difference]: Without dead ends: 1603 [2019-12-27 21:25:17,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-12-27 21:25:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1078. [2019-12-27 21:25:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-27 21:25:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3127 transitions. [2019-12-27 21:25:17,566 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3127 transitions. Word has length 59 [2019-12-27 21:25:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:17,567 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 3127 transitions. [2019-12-27 21:25:17,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3127 transitions. [2019-12-27 21:25:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:25:17,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:17,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:17,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:17,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2055576731, now seen corresponding path program 1 times [2019-12-27 21:25:17,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:17,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706903703] [2019-12-27 21:25:17,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:17,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706903703] [2019-12-27 21:25:17,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:17,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:25:17,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1551909621] [2019-12-27 21:25:17,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:17,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:17,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 207 transitions. [2019-12-27 21:25:17,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:18,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:25:18,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:25:18,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:25:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:25:18,014 INFO L87 Difference]: Start difference. First operand 1078 states and 3127 transitions. Second operand 13 states. [2019-12-27 21:25:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:18,864 INFO L93 Difference]: Finished difference Result 2609 states and 6943 transitions. [2019-12-27 21:25:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:25:18,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-27 21:25:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:18,868 INFO L225 Difference]: With dead ends: 2609 [2019-12-27 21:25:18,868 INFO L226 Difference]: Without dead ends: 1591 [2019-12-27 21:25:18,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:25:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-27 21:25:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 948. [2019-12-27 21:25:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-27 21:25:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2687 transitions. [2019-12-27 21:25:18,884 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2687 transitions. Word has length 59 [2019-12-27 21:25:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:18,884 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2687 transitions. [2019-12-27 21:25:18,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:25:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2687 transitions. [2019-12-27 21:25:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:25:18,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:18,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:18,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 2 times [2019-12-27 21:25:18,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:18,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773983083] [2019-12-27 21:25:18,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:19,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773983083] [2019-12-27 21:25:19,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:19,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:19,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436143069] [2019-12-27 21:25:19,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:19,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:19,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 21:25:19,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:19,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:25:19,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:19,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:19,141 INFO L87 Difference]: Start difference. First operand 948 states and 2687 transitions. Second operand 6 states. [2019-12-27 21:25:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:19,316 INFO L93 Difference]: Finished difference Result 1456 states and 3844 transitions. [2019-12-27 21:25:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:19,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 21:25:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:19,319 INFO L225 Difference]: With dead ends: 1456 [2019-12-27 21:25:19,319 INFO L226 Difference]: Without dead ends: 859 [2019-12-27 21:25:19,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:25:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-27 21:25:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 691. [2019-12-27 21:25:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-27 21:25:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1728 transitions. [2019-12-27 21:25:19,328 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1728 transitions. Word has length 59 [2019-12-27 21:25:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:19,329 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1728 transitions. [2019-12-27 21:25:19,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1728 transitions. [2019-12-27 21:25:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:25:19,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:19,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:19,330 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -5405835, now seen corresponding path program 3 times [2019-12-27 21:25:19,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:19,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906656539] [2019-12-27 21:25:19,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:19,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906656539] [2019-12-27 21:25:19,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:19,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:19,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294357989] [2019-12-27 21:25:19,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:19,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:19,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 21:25:19,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:19,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:25:19,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:19,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:19,539 INFO L87 Difference]: Start difference. First operand 691 states and 1728 transitions. Second operand 5 states. [2019-12-27 21:25:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:19,731 INFO L93 Difference]: Finished difference Result 826 states and 1994 transitions. [2019-12-27 21:25:19,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:19,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 21:25:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:19,733 INFO L225 Difference]: With dead ends: 826 [2019-12-27 21:25:19,733 INFO L226 Difference]: Without dead ends: 826 [2019-12-27 21:25:19,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:25:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-12-27 21:25:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 602. [2019-12-27 21:25:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 21:25:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1452 transitions. [2019-12-27 21:25:19,743 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1452 transitions. Word has length 59 [2019-12-27 21:25:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:19,744 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1452 transitions. [2019-12-27 21:25:19,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1452 transitions. [2019-12-27 21:25:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:25:19,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:19,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:19,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1587836330, now seen corresponding path program 1 times [2019-12-27 21:25:19,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:19,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133559177] [2019-12-27 21:25:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:19,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133559177] [2019-12-27 21:25:19,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:19,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:19,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1773667684] [2019-12-27 21:25:19,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:19,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:19,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 213 transitions. [2019-12-27 21:25:19,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:20,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:25:20,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:20,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:20,065 INFO L87 Difference]: Start difference. First operand 602 states and 1452 transitions. Second operand 6 states. [2019-12-27 21:25:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:20,253 INFO L93 Difference]: Finished difference Result 1050 states and 2415 transitions. [2019-12-27 21:25:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:20,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:25:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:20,254 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 21:25:20,254 INFO L226 Difference]: Without dead ends: 327 [2019-12-27 21:25:20,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:25:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-27 21:25:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 234. [2019-12-27 21:25:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-27 21:25:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-27 21:25:20,259 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 60 [2019-12-27 21:25:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:20,259 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-27 21:25:20,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-27 21:25:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:25:20,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:20,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:20,261 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 2 times [2019-12-27 21:25:20,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:20,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883883010] [2019-12-27 21:25:20,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:20,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883883010] [2019-12-27 21:25:20,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:20,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:25:20,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894725665] [2019-12-27 21:25:20,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:20,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:20,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 258 transitions. [2019-12-27 21:25:20,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:20,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:25:20,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:25:20,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:20,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:25:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:25:20,766 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 15 states. [2019-12-27 21:25:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:22,098 INFO L93 Difference]: Finished difference Result 518 states and 889 transitions. [2019-12-27 21:25:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:25:22,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:25:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:22,100 INFO L225 Difference]: With dead ends: 518 [2019-12-27 21:25:22,100 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 21:25:22,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:25:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 21:25:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 330. [2019-12-27 21:25:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 21:25:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 577 transitions. [2019-12-27 21:25:22,106 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 577 transitions. Word has length 60 [2019-12-27 21:25:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:22,106 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 577 transitions. [2019-12-27 21:25:22,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:25:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 577 transitions. [2019-12-27 21:25:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:25:22,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:22,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:22,107 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 3 times [2019-12-27 21:25:22,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:22,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876424685] [2019-12-27 21:25:22,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:22,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876424685] [2019-12-27 21:25:22,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:22,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:25:22,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957628539] [2019-12-27 21:25:22,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:22,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:22,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 321 transitions. [2019-12-27 21:25:22,598 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:22,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:25:22,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:25:22,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:25:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:25:22,762 INFO L87 Difference]: Start difference. First operand 330 states and 577 transitions. Second operand 16 states. [2019-12-27 21:25:23,177 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-27 21:25:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:24,939 INFO L93 Difference]: Finished difference Result 674 states and 1123 transitions. [2019-12-27 21:25:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 21:25:24,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-27 21:25:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:24,944 INFO L225 Difference]: With dead ends: 674 [2019-12-27 21:25:24,944 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 21:25:24,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 21:25:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 21:25:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 334. [2019-12-27 21:25:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-27 21:25:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 584 transitions. [2019-12-27 21:25:24,949 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 584 transitions. Word has length 60 [2019-12-27 21:25:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:24,949 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 584 transitions. [2019-12-27 21:25:24,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:25:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 584 transitions. [2019-12-27 21:25:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:25:24,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:24,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:24,950 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1148639144, now seen corresponding path program 4 times [2019-12-27 21:25:24,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:24,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077619874] [2019-12-27 21:25:24,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:25,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077619874] [2019-12-27 21:25:25,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:25,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:25:25,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294345267] [2019-12-27 21:25:25,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:25,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:25,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 210 transitions. [2019-12-27 21:25:25,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:25,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:25:25,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:25:25,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:25:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:25:25,391 INFO L87 Difference]: Start difference. First operand 334 states and 584 transitions. Second operand 15 states. [2019-12-27 21:25:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:25,952 INFO L93 Difference]: Finished difference Result 450 states and 764 transitions. [2019-12-27 21:25:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:25:25,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:25:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:25,954 INFO L225 Difference]: With dead ends: 450 [2019-12-27 21:25:25,954 INFO L226 Difference]: Without dead ends: 420 [2019-12-27 21:25:25,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:25:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-12-27 21:25:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 342. [2019-12-27 21:25:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 21:25:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-27 21:25:25,959 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-27 21:25:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:25,960 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-27 21:25:25,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:25:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-27 21:25:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:25:25,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:25,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:25,961 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:25,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 5 times [2019-12-27 21:25:25,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:25,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931362067] [2019-12-27 21:25:25,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:26,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:25:26,093 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:25:26,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1277~0.base_21|) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21|)) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21| 1) |v_#valid_71|) (= v_~z~0_27 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1277~0.base_21| 4) |v_#length_29|) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21|) |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$w_buff1_used~0_66) (= |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1277~0.base=|v_ULTIMATE.start_main_~#t1277~0.base_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_23|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_~#t1277~0.offset=|v_ULTIMATE.start_main_~#t1277~0.offset_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_23|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_22|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_18|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1277~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1280~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1277~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1279~0.offset, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1278~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1279~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-27 21:25:26,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1278~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1278~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1278~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13|) |v_ULTIMATE.start_main_~#t1278~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1278~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_13|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1278~0.base, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-27 21:25:26,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11|) |v_ULTIMATE.start_main_~#t1279~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t1279~0.base_11|)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1279~0.offset_10|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1279~0.base_11|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1279~0.base_11| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1279~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1279~0.offset] because there is no mapped edge [2019-12-27 21:25:26,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1280~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13|) |v_ULTIMATE.start_main_~#t1280~0.offset_11| 3)) |v_#memory_int_17|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1280~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1280~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1280~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_11|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1280~0.base] because there is no mapped edge [2019-12-27 21:25:26,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:25:26,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:25:26,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:25:26,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1839767159 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1839767159 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1839767159| ~z$w_buff0_used~0_In-1839767159) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1839767159| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839767159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1839767159} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839767159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1839767159, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1839767159|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:25:26,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In215908038 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In215908038 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In215908038 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In215908038 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out215908038|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In215908038 |P3Thread1of1ForFork3_#t~ite12_Out215908038|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In215908038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215908038, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In215908038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215908038} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In215908038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215908038, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In215908038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215908038, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out215908038|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:25:26,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1983758687 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1983758687 256)))) (or (and (= ~z~0_In-1983758687 |P2Thread1of1ForFork2_#t~ite3_Out-1983758687|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1983758687 |P2Thread1of1ForFork2_#t~ite3_Out-1983758687|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1983758687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1983758687, ~z$w_buff1~0=~z$w_buff1~0_In-1983758687, ~z~0=~z~0_In-1983758687} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1983758687|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1983758687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1983758687, ~z$w_buff1~0=~z$w_buff1~0_In-1983758687, ~z~0=~z~0_In-1983758687} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:25:26,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:25:26,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-797810450 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-797810450 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-797810450 |P2Thread1of1ForFork2_#t~ite5_Out-797810450|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-797810450|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-797810450, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-797810450} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-797810450|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-797810450, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-797810450} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:25:26,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-305221246 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-305221246 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-305221246 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-305221246 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-305221246| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-305221246| ~z$w_buff1_used~0_In-305221246) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-305221246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-305221246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-305221246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-305221246} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-305221246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-305221246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-305221246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-305221246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-305221246} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:25:26,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1023715294 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1023715294 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1023715294| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1023715294| ~z$r_buff0_thd3~0_In1023715294) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1023715294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1023715294} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1023715294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1023715294, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1023715294|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:25:26,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-324530940 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-324530940 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-324530940 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-324530940 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-324530940|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-324530940 |P2Thread1of1ForFork2_#t~ite8_Out-324530940|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-324530940, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-324530940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-324530940, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324530940} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-324530940, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-324530940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-324530940, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324530940, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-324530940|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:25:26,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:25:26,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1971366700 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1971366700 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-1971366700 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-1971366700 ~z$r_buff0_thd4~0_In-1971366700)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1971366700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1971366700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1971366700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1971366700, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1971366700|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:25:26,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1834972148 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1834972148 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1834972148 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1834972148 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-1834972148| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out-1834972148| ~z$r_buff1_thd4~0_In-1834972148) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1834972148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834972148, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1834972148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834972148} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1834972148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834972148, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1834972148|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1834972148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834972148} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:25:26,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:25:26,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:25:26,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-2083379032 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2083379032 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-2083379032| |ULTIMATE.start_main_#t~ite20_Out-2083379032|))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-2083379032| ~z$w_buff1~0_In-2083379032) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-2083379032| ~z~0_In-2083379032) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2083379032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2083379032, ~z$w_buff1~0=~z$w_buff1~0_In-2083379032, ~z~0=~z~0_In-2083379032} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2083379032|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2083379032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2083379032, ~z$w_buff1~0=~z$w_buff1~0_In-2083379032, ~z~0=~z~0_In-2083379032, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2083379032|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:25:26,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-854395332 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-854395332 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-854395332| ~z$w_buff0_used~0_In-854395332) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-854395332| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-854395332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854395332} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-854395332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854395332, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-854395332|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:25:26,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In108864070 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In108864070 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In108864070 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In108864070 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In108864070 |ULTIMATE.start_main_#t~ite22_Out108864070|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite22_Out108864070|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In108864070, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108864070, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108864070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108864070} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In108864070, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108864070, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108864070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108864070, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out108864070|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:25:26,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1828710152 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1828710152 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1828710152 |ULTIMATE.start_main_#t~ite23_Out-1828710152|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1828710152| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1828710152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828710152} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1828710152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828710152, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1828710152|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:25:26,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1033464867 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1033464867 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1033464867 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1033464867 256)))) (or (and (= ~z$r_buff1_thd0~0_In1033464867 |ULTIMATE.start_main_#t~ite24_Out1033464867|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite24_Out1033464867|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1033464867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1033464867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1033464867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1033464867} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1033464867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1033464867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1033464867, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1033464867|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1033464867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:25:26,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1198446388 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_In-1198446388| |ULTIMATE.start_main_#t~ite30_Out-1198446388|) (not .cse0) (= ~z$w_buff0~0_In-1198446388 |ULTIMATE.start_main_#t~ite31_Out-1198446388|)) (and (= |ULTIMATE.start_main_#t~ite31_Out-1198446388| |ULTIMATE.start_main_#t~ite30_Out-1198446388|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1198446388 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1198446388 256))) (= (mod ~z$w_buff0_used~0_In-1198446388 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1198446388 256))))) (= ~z$w_buff0~0_In-1198446388 |ULTIMATE.start_main_#t~ite30_Out-1198446388|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1198446388, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1198446388|, ~z$w_buff0~0=~z$w_buff0~0_In-1198446388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198446388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1198446388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198446388, ~weak$$choice2~0=~weak$$choice2~0_In-1198446388} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1198446388, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1198446388|, ~z$w_buff0~0=~z$w_buff0~0_In-1198446388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198446388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1198446388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198446388, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1198446388|, ~weak$$choice2~0=~weak$$choice2~0_In-1198446388} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 21:25:26,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In134335675 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out134335675| |ULTIMATE.start_main_#t~ite33_Out134335675|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In134335675 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd0~0_In134335675 256) 0)) (and .cse0 (= (mod ~z$w_buff1_used~0_In134335675 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In134335675 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite33_Out134335675| ~z$w_buff1~0_In134335675)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out134335675| ~z$w_buff1~0_In134335675) (= |ULTIMATE.start_main_#t~ite33_In134335675| |ULTIMATE.start_main_#t~ite33_Out134335675|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In134335675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In134335675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In134335675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In134335675, ~z$w_buff1~0=~z$w_buff1~0_In134335675, ~weak$$choice2~0=~weak$$choice2~0_In134335675, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In134335675|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In134335675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In134335675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In134335675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In134335675, ~z$w_buff1~0=~z$w_buff1~0_In134335675, ~weak$$choice2~0=~weak$$choice2~0_In134335675, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out134335675|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out134335675|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:25:26,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:25:26,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1990741197 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1990741197| |ULTIMATE.start_main_#t~ite45_Out1990741197|) (= ~z$r_buff1_thd0~0_In1990741197 |ULTIMATE.start_main_#t~ite45_Out1990741197|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1990741197 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1990741197 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1990741197 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1990741197 256)) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite46_Out1990741197| ~z$r_buff1_thd0~0_In1990741197) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1990741197| |ULTIMATE.start_main_#t~ite45_Out1990741197|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1990741197, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1990741197, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1990741197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990741197, ~weak$$choice2~0=~weak$$choice2~0_In1990741197, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1990741197|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1990741197, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1990741197, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1990741197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990741197, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1990741197|, ~weak$$choice2~0=~weak$$choice2~0_In1990741197, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1990741197|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:25:26,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:25:26,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:25:26,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:25:26 BasicIcfg [2019-12-27 21:25:26,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:25:26,244 INFO L168 Benchmark]: Toolchain (without parser) took 36852.11 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 101.3 MB in the beginning and 604.2 MB in the end (delta: -502.9 MB). Peak memory consumption was 933.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,245 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.17 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 153.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 150.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,247 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,247 INFO L168 Benchmark]: RCFGBuilder took 882.31 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,248 INFO L168 Benchmark]: TraceAbstraction took 35061.04 ms. Allocated memory was 202.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 98.0 MB in the beginning and 604.2 MB in the end (delta: -506.2 MB). Peak memory consumption was 865.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:26,251 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.17 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 153.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 150.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.31 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35061.04 ms. Allocated memory was 202.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 98.0 MB in the beginning and 604.2 MB in the end (delta: -506.2 MB). Peak memory consumption was 865.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2129 SDtfs, 3634 SDslu, 7192 SDs, 0 SdLazy, 4991 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 100 SyntacticMatches, 32 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 11708 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 210337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...