/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:50:56,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:50:56,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:50:56,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:50:56,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:50:56,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:50:56,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:50:56,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:50:56,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:50:56,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:50:56,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:50:56,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:50:56,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:50:56,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:50:56,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:50:56,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:50:56,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:50:56,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:50:56,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:50:56,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:50:56,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:50:56,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:50:56,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:50:56,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:50:56,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:50:56,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:50:56,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:50:56,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:50:56,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:50:56,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:50:56,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:50:56,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:50:56,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:50:56,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:50:56,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:50:56,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:50:56,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:50:56,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:50:56,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:50:56,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:50:56,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:50:56,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:50:56,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:50:56,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:50:56,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:50:56,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:50:56,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:50:56,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:50:56,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:50:56,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:50:56,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:50:56,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:50:56,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:50:56,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:50:56,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:50:56,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:50:56,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:50:56,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:50:56,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:50:56,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:50:56,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:50:56,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:50:56,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:50:56,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:50:56,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:50:56,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:50:56,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:50:56,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:50:56,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:50:56,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:50:56,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:50:56,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:50:56,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:50:56,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:50:56,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:50:56,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:50:56,541 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:50:56,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-18 22:50:56,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cdd5c49/b5d79fb78f61408683b92ea5c7e2844b/FLAG325a249c1 [2019-12-18 22:50:57,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:50:57,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-18 22:50:57,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cdd5c49/b5d79fb78f61408683b92ea5c7e2844b/FLAG325a249c1 [2019-12-18 22:50:57,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cdd5c49/b5d79fb78f61408683b92ea5c7e2844b [2019-12-18 22:50:57,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:50:57,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:50:57,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:50:57,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:50:57,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:50:57,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:50:57" (1/1) ... [2019-12-18 22:50:57,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123cbba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:57, skipping insertion in model container [2019-12-18 22:50:57,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:50:57" (1/1) ... [2019-12-18 22:50:57,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:50:57,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:50:58,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:50:58,164 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:50:58,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:50:58,310 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:50:58,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58 WrapperNode [2019-12-18 22:50:58,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:50:58,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:50:58,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:50:58,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:50:58,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:50:58,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:50:58,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:50:58,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:50:58,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... [2019-12-18 22:50:58,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:50:58,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:50:58,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:50:58,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:50:58,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:50:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:50:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:50:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:50:58,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:50:58,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:50:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:50:58,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:50:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:50:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:50:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:50:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:50:58,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:50:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:50:58,506 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:50:59,269 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:50:59,270 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:50:59,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:50:59 BoogieIcfgContainer [2019-12-18 22:50:59,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:50:59,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:50:59,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:50:59,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:50:59,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:50:57" (1/3) ... [2019-12-18 22:50:59,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41286b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:50:59, skipping insertion in model container [2019-12-18 22:50:59,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:58" (2/3) ... [2019-12-18 22:50:59,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41286b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:50:59, skipping insertion in model container [2019-12-18 22:50:59,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:50:59" (3/3) ... [2019-12-18 22:50:59,280 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-18 22:50:59,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:50:59,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:50:59,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:50:59,298 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:50:59,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,403 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,404 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:50:59,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:50:59,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:50:59,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:50:59,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:50:59,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:50:59,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:50:59,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:50:59,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:50:59,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:50:59,464 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 22:50:59,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:50:59,550 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:50:59,550 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:50:59,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:50:59,595 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:50:59,656 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:50:59,657 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:50:59,670 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:50:59,693 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:50:59,695 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:51:00,373 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 22:51:03,426 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 22:51:03,563 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 22:51:03,580 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-18 22:51:03,580 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:51:03,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-18 22:51:15,555 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-18 22:51:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-18 22:51:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:51:15,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:15,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:51:15,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-18 22:51:15,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:15,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109886356] [2019-12-18 22:51:15,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:15,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109886356] [2019-12-18 22:51:15,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:15,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:51:15,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58014501] [2019-12-18 22:51:15,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:51:15,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:51:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:15,834 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-18 22:51:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:18,718 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-18 22:51:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:51:18,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:51:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:19,329 INFO L225 Difference]: With dead ends: 84652 [2019-12-18 22:51:19,329 INFO L226 Difference]: Without dead ends: 79738 [2019-12-18 22:51:19,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-18 22:51:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-18 22:51:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-18 22:51:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-18 22:51:27,108 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-18 22:51:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:27,108 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-18 22:51:27,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:51:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-18 22:51:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:51:27,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:27,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:27,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-18 22:51:27,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:27,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177377443] [2019-12-18 22:51:27,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177377443] [2019-12-18 22:51:27,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:27,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:51:27,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838685084] [2019-12-18 22:51:27,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:51:27,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:27,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:51:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:51:27,228 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-18 22:51:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:31,866 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-18 22:51:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:51:31,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:51:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:32,697 INFO L225 Difference]: With dead ends: 122590 [2019-12-18 22:51:32,698 INFO L226 Difference]: Without dead ends: 122513 [2019-12-18 22:51:32,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-18 22:51:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-18 22:51:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-18 22:51:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-18 22:51:39,317 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-18 22:51:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:39,318 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-18 22:51:39,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:51:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-18 22:51:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:51:39,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:39,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:39,322 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-18 22:51:39,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:39,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798775911] [2019-12-18 22:51:39,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:39,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798775911] [2019-12-18 22:51:39,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:39,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:51:39,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655754230] [2019-12-18 22:51:39,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:51:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:51:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:39,384 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-18 22:51:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:39,490 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-18 22:51:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:51:39,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:51:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:39,537 INFO L225 Difference]: With dead ends: 27590 [2019-12-18 22:51:39,537 INFO L226 Difference]: Without dead ends: 27590 [2019-12-18 22:51:39,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-18 22:51:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-18 22:51:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 22:51:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-18 22:51:43,707 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-18 22:51:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:43,707 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-18 22:51:43,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:51:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-18 22:51:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:51:43,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:43,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:43,709 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-18 22:51:43,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:43,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421495753] [2019-12-18 22:51:43,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:43,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421495753] [2019-12-18 22:51:43,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:43,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:51:43,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764190570] [2019-12-18 22:51:43,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:51:43,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:51:43,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:43,805 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-18 22:51:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:44,318 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-18 22:51:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:51:44,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:51:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:44,388 INFO L225 Difference]: With dead ends: 40899 [2019-12-18 22:51:44,388 INFO L226 Difference]: Without dead ends: 40883 [2019-12-18 22:51:44,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:51:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-18 22:51:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-18 22:51:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-18 22:51:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-18 22:51:45,003 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-18 22:51:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:45,003 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-18 22:51:45,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:51:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-18 22:51:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:51:45,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:45,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:45,014 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-18 22:51:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173316851] [2019-12-18 22:51:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:45,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173316851] [2019-12-18 22:51:45,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:45,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:51:45,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835555713] [2019-12-18 22:51:45,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:51:45,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:51:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:51:45,179 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-18 22:51:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:46,101 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-18 22:51:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:51:46,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:51:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:46,551 INFO L225 Difference]: With dead ends: 48043 [2019-12-18 22:51:46,552 INFO L226 Difference]: Without dead ends: 48015 [2019-12-18 22:51:46,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:51:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-18 22:51:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-18 22:51:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-18 22:51:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-18 22:51:47,204 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-18 22:51:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:47,205 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-18 22:51:47,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:51:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-18 22:51:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:51:47,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:47,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:47,222 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-18 22:51:47,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:47,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154932961] [2019-12-18 22:51:47,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:47,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154932961] [2019-12-18 22:51:47,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:47,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:51:47,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814693048] [2019-12-18 22:51:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:51:47,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:51:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:51:47,288 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-18 22:51:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:47,353 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-18 22:51:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:51:47,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:51:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:47,376 INFO L225 Difference]: With dead ends: 12531 [2019-12-18 22:51:47,376 INFO L226 Difference]: Without dead ends: 12531 [2019-12-18 22:51:47,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:51:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-18 22:51:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-18 22:51:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-18 22:51:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-18 22:51:47,573 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-18 22:51:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:47,573 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-18 22:51:47,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:51:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-18 22:51:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:51:47,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:47,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:47,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-18 22:51:47,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:47,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544657823] [2019-12-18 22:51:47,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:47,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544657823] [2019-12-18 22:51:47,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:47,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:51:47,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420315135] [2019-12-18 22:51:47,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:51:47,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:51:47,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:47,697 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 5 states. [2019-12-18 22:51:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:48,213 INFO L93 Difference]: Finished difference Result 17659 states and 53000 transitions. [2019-12-18 22:51:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:51:48,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 22:51:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:48,238 INFO L225 Difference]: With dead ends: 17659 [2019-12-18 22:51:48,238 INFO L226 Difference]: Without dead ends: 17659 [2019-12-18 22:51:48,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 22:51:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2019-12-18 22:51:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 16146. [2019-12-18 22:51:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-18 22:51:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 48801 transitions. [2019-12-18 22:51:48,486 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 48801 transitions. Word has length 39 [2019-12-18 22:51:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:48,486 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 48801 transitions. [2019-12-18 22:51:48,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:51:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 48801 transitions. [2019-12-18 22:51:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:51:48,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:48,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:48,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1354690859, now seen corresponding path program 2 times [2019-12-18 22:51:48,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:48,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625314242] [2019-12-18 22:51:48,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:48,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625314242] [2019-12-18 22:51:48,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:48,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:51:48,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917087702] [2019-12-18 22:51:48,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:51:48,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:51:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:51:48,608 INFO L87 Difference]: Start difference. First operand 16146 states and 48801 transitions. Second operand 6 states. [2019-12-18 22:51:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:49,531 INFO L93 Difference]: Finished difference Result 28014 states and 84353 transitions. [2019-12-18 22:51:49,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:51:49,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 22:51:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:49,571 INFO L225 Difference]: With dead ends: 28014 [2019-12-18 22:51:49,572 INFO L226 Difference]: Without dead ends: 28014 [2019-12-18 22:51:49,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:51:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-18 22:51:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 17882. [2019-12-18 22:51:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17882 states. [2019-12-18 22:51:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17882 states to 17882 states and 54176 transitions. [2019-12-18 22:51:49,895 INFO L78 Accepts]: Start accepts. Automaton has 17882 states and 54176 transitions. Word has length 39 [2019-12-18 22:51:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 17882 states and 54176 transitions. [2019-12-18 22:51:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:51:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17882 states and 54176 transitions. [2019-12-18 22:51:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:51:49,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:49,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:49,920 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1850486613, now seen corresponding path program 3 times [2019-12-18 22:51:49,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:49,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826353939] [2019-12-18 22:51:49,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:49,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826353939] [2019-12-18 22:51:49,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:49,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:51:49,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430081220] [2019-12-18 22:51:49,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:51:49,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:51:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:49,987 INFO L87 Difference]: Start difference. First operand 17882 states and 54176 transitions. Second operand 5 states. [2019-12-18 22:51:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:50,086 INFO L93 Difference]: Finished difference Result 16509 states and 50641 transitions. [2019-12-18 22:51:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:51:50,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 22:51:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:50,108 INFO L225 Difference]: With dead ends: 16509 [2019-12-18 22:51:50,109 INFO L226 Difference]: Without dead ends: 16509 [2019-12-18 22:51:50,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2019-12-18 22:51:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 15675. [2019-12-18 22:51:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15675 states. [2019-12-18 22:51:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15675 states to 15675 states and 48288 transitions. [2019-12-18 22:51:50,348 INFO L78 Accepts]: Start accepts. Automaton has 15675 states and 48288 transitions. Word has length 39 [2019-12-18 22:51:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:50,348 INFO L462 AbstractCegarLoop]: Abstraction has 15675 states and 48288 transitions. [2019-12-18 22:51:50,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:51:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 15675 states and 48288 transitions. [2019-12-18 22:51:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:50,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:50,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:50,368 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1166865475, now seen corresponding path program 1 times [2019-12-18 22:51:50,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:50,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148905562] [2019-12-18 22:51:50,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:50,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148905562] [2019-12-18 22:51:50,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:50,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:51:50,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216898526] [2019-12-18 22:51:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:51:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:51:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:51:50,455 INFO L87 Difference]: Start difference. First operand 15675 states and 48288 transitions. Second operand 4 states. [2019-12-18 22:51:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:50,589 INFO L93 Difference]: Finished difference Result 28485 states and 87800 transitions. [2019-12-18 22:51:50,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:51:50,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:51:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:50,621 INFO L225 Difference]: With dead ends: 28485 [2019-12-18 22:51:50,621 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 22:51:50,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:51:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 22:51:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 13391. [2019-12-18 22:51:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13391 states. [2019-12-18 22:51:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13391 states to 13391 states and 41122 transitions. [2019-12-18 22:51:50,911 INFO L78 Accepts]: Start accepts. Automaton has 13391 states and 41122 transitions. Word has length 54 [2019-12-18 22:51:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:50,912 INFO L462 AbstractCegarLoop]: Abstraction has 13391 states and 41122 transitions. [2019-12-18 22:51:50,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:51:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 13391 states and 41122 transitions. [2019-12-18 22:51:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:50,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:50,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:50,927 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2026182027, now seen corresponding path program 2 times [2019-12-18 22:51:50,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:50,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123790931] [2019-12-18 22:51:50,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:51,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123790931] [2019-12-18 22:51:51,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:51,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:51:51,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350564555] [2019-12-18 22:51:51,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:51:51,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:51:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:51:51,026 INFO L87 Difference]: Start difference. First operand 13391 states and 41122 transitions. Second operand 7 states. [2019-12-18 22:51:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:51,431 INFO L93 Difference]: Finished difference Result 32485 states and 98796 transitions. [2019-12-18 22:51:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:51:51,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:51:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:51,468 INFO L225 Difference]: With dead ends: 32485 [2019-12-18 22:51:51,468 INFO L226 Difference]: Without dead ends: 24797 [2019-12-18 22:51:51,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:51:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-12-18 22:51:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 15424. [2019-12-18 22:51:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15424 states. [2019-12-18 22:51:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 47254 transitions. [2019-12-18 22:51:51,957 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 47254 transitions. Word has length 54 [2019-12-18 22:51:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:51,958 INFO L462 AbstractCegarLoop]: Abstraction has 15424 states and 47254 transitions. [2019-12-18 22:51:51,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:51:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 47254 transitions. [2019-12-18 22:51:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:51,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:51,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:51,977 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash -345709295, now seen corresponding path program 3 times [2019-12-18 22:51:51,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:51,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327135802] [2019-12-18 22:51:51,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:52,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327135802] [2019-12-18 22:51:52,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:52,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:51:52,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335429585] [2019-12-18 22:51:52,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:51:52,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:51:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:51:52,085 INFO L87 Difference]: Start difference. First operand 15424 states and 47254 transitions. Second operand 7 states. [2019-12-18 22:51:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:52,507 INFO L93 Difference]: Finished difference Result 36083 states and 108358 transitions. [2019-12-18 22:51:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:51:52,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:51:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:52,548 INFO L225 Difference]: With dead ends: 36083 [2019-12-18 22:51:52,549 INFO L226 Difference]: Without dead ends: 25619 [2019-12-18 22:51:52,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:51:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25619 states. [2019-12-18 22:51:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25619 to 17229. [2019-12-18 22:51:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17229 states. [2019-12-18 22:51:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17229 states to 17229 states and 52420 transitions. [2019-12-18 22:51:52,881 INFO L78 Accepts]: Start accepts. Automaton has 17229 states and 52420 transitions. Word has length 54 [2019-12-18 22:51:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:52,881 INFO L462 AbstractCegarLoop]: Abstraction has 17229 states and 52420 transitions. [2019-12-18 22:51:52,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:51:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17229 states and 52420 transitions. [2019-12-18 22:51:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:52,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:52,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:52,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1893996223, now seen corresponding path program 4 times [2019-12-18 22:51:52,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:52,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989207890] [2019-12-18 22:51:52,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:52,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989207890] [2019-12-18 22:51:52,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:52,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:51:52,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432177425] [2019-12-18 22:51:52,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:51:52,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:51:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:51:52,997 INFO L87 Difference]: Start difference. First operand 17229 states and 52420 transitions. Second operand 7 states. [2019-12-18 22:51:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:53,379 INFO L93 Difference]: Finished difference Result 35362 states and 106807 transitions. [2019-12-18 22:51:53,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:51:53,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:51:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:53,425 INFO L225 Difference]: With dead ends: 35362 [2019-12-18 22:51:53,425 INFO L226 Difference]: Without dead ends: 31672 [2019-12-18 22:51:53,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:51:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31672 states. [2019-12-18 22:51:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31672 to 17439. [2019-12-18 22:51:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17439 states. [2019-12-18 22:51:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17439 states to 17439 states and 53184 transitions. [2019-12-18 22:51:53,805 INFO L78 Accepts]: Start accepts. Automaton has 17439 states and 53184 transitions. Word has length 54 [2019-12-18 22:51:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:53,805 INFO L462 AbstractCegarLoop]: Abstraction has 17439 states and 53184 transitions. [2019-12-18 22:51:53,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:51:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17439 states and 53184 transitions. [2019-12-18 22:51:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:53,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:53,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:53,831 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash -763040279, now seen corresponding path program 1 times [2019-12-18 22:51:53,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:53,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885075532] [2019-12-18 22:51:53,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:53,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885075532] [2019-12-18 22:51:53,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:53,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:51:53,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949950774] [2019-12-18 22:51:53,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:51:53,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:51:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:53,891 INFO L87 Difference]: Start difference. First operand 17439 states and 53184 transitions. Second operand 3 states. [2019-12-18 22:51:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:54,017 INFO L93 Difference]: Finished difference Result 25639 states and 78092 transitions. [2019-12-18 22:51:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:51:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:51:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:54,075 INFO L225 Difference]: With dead ends: 25639 [2019-12-18 22:51:54,075 INFO L226 Difference]: Without dead ends: 25639 [2019-12-18 22:51:54,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25639 states. [2019-12-18 22:51:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25639 to 22781. [2019-12-18 22:51:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22781 states. [2019-12-18 22:51:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22781 states to 22781 states and 69876 transitions. [2019-12-18 22:51:54,828 INFO L78 Accepts]: Start accepts. Automaton has 22781 states and 69876 transitions. Word has length 54 [2019-12-18 22:51:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:54,828 INFO L462 AbstractCegarLoop]: Abstraction has 22781 states and 69876 transitions. [2019-12-18 22:51:54,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:51:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 22781 states and 69876 transitions. [2019-12-18 22:51:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:54,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:54,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:54,852 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 709346415, now seen corresponding path program 5 times [2019-12-18 22:51:54,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:54,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124449695] [2019-12-18 22:51:54,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:54,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124449695] [2019-12-18 22:51:54,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:54,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:51:54,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958158032] [2019-12-18 22:51:54,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:51:54,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:51:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:51:54,973 INFO L87 Difference]: Start difference. First operand 22781 states and 69876 transitions. Second operand 7 states. [2019-12-18 22:51:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:55,895 INFO L93 Difference]: Finished difference Result 31754 states and 94887 transitions. [2019-12-18 22:51:55,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:51:55,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:51:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:55,940 INFO L225 Difference]: With dead ends: 31754 [2019-12-18 22:51:55,940 INFO L226 Difference]: Without dead ends: 31754 [2019-12-18 22:51:55,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:51:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-12-18 22:51:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 24278. [2019-12-18 22:51:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24278 states. [2019-12-18 22:51:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24278 states to 24278 states and 74075 transitions. [2019-12-18 22:51:56,362 INFO L78 Accepts]: Start accepts. Automaton has 24278 states and 74075 transitions. Word has length 54 [2019-12-18 22:51:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:56,363 INFO L462 AbstractCegarLoop]: Abstraction has 24278 states and 74075 transitions. [2019-12-18 22:51:56,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:51:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 24278 states and 74075 transitions. [2019-12-18 22:51:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:56,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:56,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:56,387 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1752990847, now seen corresponding path program 6 times [2019-12-18 22:51:56,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:56,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169827049] [2019-12-18 22:51:56,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:56,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169827049] [2019-12-18 22:51:56,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:56,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:51:56,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509515512] [2019-12-18 22:51:56,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:51:56,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:51:56,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:51:56,523 INFO L87 Difference]: Start difference. First operand 24278 states and 74075 transitions. Second operand 9 states. [2019-12-18 22:51:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:58,369 INFO L93 Difference]: Finished difference Result 40208 states and 120418 transitions. [2019-12-18 22:51:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:51:58,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:51:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:58,426 INFO L225 Difference]: With dead ends: 40208 [2019-12-18 22:51:58,426 INFO L226 Difference]: Without dead ends: 40208 [2019-12-18 22:51:58,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:51:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40208 states. [2019-12-18 22:51:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40208 to 22831. [2019-12-18 22:51:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22831 states. [2019-12-18 22:51:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22831 states to 22831 states and 69909 transitions. [2019-12-18 22:51:59,148 INFO L78 Accepts]: Start accepts. Automaton has 22831 states and 69909 transitions. Word has length 54 [2019-12-18 22:51:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:59,148 INFO L462 AbstractCegarLoop]: Abstraction has 22831 states and 69909 transitions. [2019-12-18 22:51:59,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:51:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22831 states and 69909 transitions. [2019-12-18 22:51:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:51:59,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:59,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:59,175 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -931727569, now seen corresponding path program 7 times [2019-12-18 22:51:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506518303] [2019-12-18 22:51:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:51:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:51:59,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506518303] [2019-12-18 22:51:59,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:51:59,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:51:59,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972465768] [2019-12-18 22:51:59,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:51:59,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:51:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:51:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:59,251 INFO L87 Difference]: Start difference. First operand 22831 states and 69909 transitions. Second operand 3 states. [2019-12-18 22:51:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:51:59,329 INFO L93 Difference]: Finished difference Result 16943 states and 51210 transitions. [2019-12-18 22:51:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:51:59,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:51:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:51:59,359 INFO L225 Difference]: With dead ends: 16943 [2019-12-18 22:51:59,360 INFO L226 Difference]: Without dead ends: 16943 [2019-12-18 22:51:59,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:51:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16943 states. [2019-12-18 22:51:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16943 to 16396. [2019-12-18 22:51:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16396 states. [2019-12-18 22:51:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16396 states to 16396 states and 49459 transitions. [2019-12-18 22:51:59,793 INFO L78 Accepts]: Start accepts. Automaton has 16396 states and 49459 transitions. Word has length 54 [2019-12-18 22:51:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:51:59,793 INFO L462 AbstractCegarLoop]: Abstraction has 16396 states and 49459 transitions. [2019-12-18 22:51:59,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:51:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 16396 states and 49459 transitions. [2019-12-18 22:51:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:51:59,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:51:59,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:51:59,825 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:51:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:51:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-18 22:51:59,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:51:59,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275345795] [2019-12-18 22:51:59,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:51:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:00,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275345795] [2019-12-18 22:52:00,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:00,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:52:00,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844884562] [2019-12-18 22:52:00,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:52:00,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:52:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:52:00,215 INFO L87 Difference]: Start difference. First operand 16396 states and 49459 transitions. Second operand 11 states. [2019-12-18 22:52:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:01,447 INFO L93 Difference]: Finished difference Result 33886 states and 102259 transitions. [2019-12-18 22:52:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 22:52:01,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:52:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:01,492 INFO L225 Difference]: With dead ends: 33886 [2019-12-18 22:52:01,492 INFO L226 Difference]: Without dead ends: 32836 [2019-12-18 22:52:01,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:52:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32836 states. [2019-12-18 22:52:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32836 to 21016. [2019-12-18 22:52:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21016 states. [2019-12-18 22:52:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21016 states to 21016 states and 63451 transitions. [2019-12-18 22:52:01,897 INFO L78 Accepts]: Start accepts. Automaton has 21016 states and 63451 transitions. Word has length 55 [2019-12-18 22:52:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:01,898 INFO L462 AbstractCegarLoop]: Abstraction has 21016 states and 63451 transitions. [2019-12-18 22:52:01,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:52:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 21016 states and 63451 transitions. [2019-12-18 22:52:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:52:01,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:01,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:01,927 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 115677024, now seen corresponding path program 2 times [2019-12-18 22:52:01,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:01,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764160944] [2019-12-18 22:52:01,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:02,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764160944] [2019-12-18 22:52:02,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:02,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:52:02,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951465287] [2019-12-18 22:52:02,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:52:02,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:52:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:52:02,139 INFO L87 Difference]: Start difference. First operand 21016 states and 63451 transitions. Second operand 11 states. [2019-12-18 22:52:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:03,055 INFO L93 Difference]: Finished difference Result 33564 states and 100560 transitions. [2019-12-18 22:52:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:52:03,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:52:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:03,092 INFO L225 Difference]: With dead ends: 33564 [2019-12-18 22:52:03,092 INFO L226 Difference]: Without dead ends: 25218 [2019-12-18 22:52:03,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:52:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25218 states. [2019-12-18 22:52:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25218 to 16236. [2019-12-18 22:52:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16236 states. [2019-12-18 22:52:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16236 states to 16236 states and 48492 transitions. [2019-12-18 22:52:03,598 INFO L78 Accepts]: Start accepts. Automaton has 16236 states and 48492 transitions. Word has length 55 [2019-12-18 22:52:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:03,599 INFO L462 AbstractCegarLoop]: Abstraction has 16236 states and 48492 transitions. [2019-12-18 22:52:03,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:52:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16236 states and 48492 transitions. [2019-12-18 22:52:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:52:03,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:03,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:03,618 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2137930756, now seen corresponding path program 3 times [2019-12-18 22:52:03,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:03,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406937459] [2019-12-18 22:52:03,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:03,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406937459] [2019-12-18 22:52:03,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:03,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:52:03,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885589639] [2019-12-18 22:52:03,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:52:03,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:52:03,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:52:03,723 INFO L87 Difference]: Start difference. First operand 16236 states and 48492 transitions. Second operand 8 states. [2019-12-18 22:52:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:05,379 INFO L93 Difference]: Finished difference Result 23904 states and 69693 transitions. [2019-12-18 22:52:05,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 22:52:05,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 22:52:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:05,410 INFO L225 Difference]: With dead ends: 23904 [2019-12-18 22:52:05,410 INFO L226 Difference]: Without dead ends: 23768 [2019-12-18 22:52:05,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:52:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23768 states. [2019-12-18 22:52:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23768 to 15979. [2019-12-18 22:52:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15979 states. [2019-12-18 22:52:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15979 states to 15979 states and 47728 transitions. [2019-12-18 22:52:05,698 INFO L78 Accepts]: Start accepts. Automaton has 15979 states and 47728 transitions. Word has length 55 [2019-12-18 22:52:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:05,698 INFO L462 AbstractCegarLoop]: Abstraction has 15979 states and 47728 transitions. [2019-12-18 22:52:05,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:52:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15979 states and 47728 transitions. [2019-12-18 22:52:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:52:05,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:05,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:05,714 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1158821550, now seen corresponding path program 4 times [2019-12-18 22:52:05,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:05,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828423984] [2019-12-18 22:52:05,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:05,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828423984] [2019-12-18 22:52:05,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:05,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:52:05,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807113012] [2019-12-18 22:52:05,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:52:05,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:52:05,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:52:05,830 INFO L87 Difference]: Start difference. First operand 15979 states and 47728 transitions. Second operand 9 states. [2019-12-18 22:52:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:06,794 INFO L93 Difference]: Finished difference Result 22964 states and 67989 transitions. [2019-12-18 22:52:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:52:06,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:52:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:06,824 INFO L225 Difference]: With dead ends: 22964 [2019-12-18 22:52:06,825 INFO L226 Difference]: Without dead ends: 22208 [2019-12-18 22:52:06,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:52:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22208 states. [2019-12-18 22:52:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22208 to 15735. [2019-12-18 22:52:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15735 states. [2019-12-18 22:52:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15735 states to 15735 states and 47035 transitions. [2019-12-18 22:52:07,092 INFO L78 Accepts]: Start accepts. Automaton has 15735 states and 47035 transitions. Word has length 55 [2019-12-18 22:52:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:07,092 INFO L462 AbstractCegarLoop]: Abstraction has 15735 states and 47035 transitions. [2019-12-18 22:52:07,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:52:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15735 states and 47035 transitions. [2019-12-18 22:52:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:52:07,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:07,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:07,108 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 5 times [2019-12-18 22:52:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:07,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338652318] [2019-12-18 22:52:07,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:07,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338652318] [2019-12-18 22:52:07,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:07,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:52:07,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964051824] [2019-12-18 22:52:07,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:52:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:52:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:52:07,172 INFO L87 Difference]: Start difference. First operand 15735 states and 47035 transitions. Second operand 3 states. [2019-12-18 22:52:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:07,243 INFO L93 Difference]: Finished difference Result 15733 states and 47030 transitions. [2019-12-18 22:52:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:52:07,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:52:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:07,271 INFO L225 Difference]: With dead ends: 15733 [2019-12-18 22:52:07,271 INFO L226 Difference]: Without dead ends: 15733 [2019-12-18 22:52:07,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:52:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15733 states. [2019-12-18 22:52:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15733 to 14313. [2019-12-18 22:52:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14313 states. [2019-12-18 22:52:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14313 states to 14313 states and 43104 transitions. [2019-12-18 22:52:07,504 INFO L78 Accepts]: Start accepts. Automaton has 14313 states and 43104 transitions. Word has length 55 [2019-12-18 22:52:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:07,504 INFO L462 AbstractCegarLoop]: Abstraction has 14313 states and 43104 transitions. [2019-12-18 22:52:07,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:52:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14313 states and 43104 transitions. [2019-12-18 22:52:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:52:07,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:07,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:07,519 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 794171059, now seen corresponding path program 1 times [2019-12-18 22:52:07,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:07,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296550054] [2019-12-18 22:52:07,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:07,773 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 22:52:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:07,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296550054] [2019-12-18 22:52:07,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:07,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:52:07,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117664374] [2019-12-18 22:52:07,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:52:07,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:52:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:52:07,931 INFO L87 Difference]: Start difference. First operand 14313 states and 43104 transitions. Second operand 12 states. [2019-12-18 22:52:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:08,811 INFO L93 Difference]: Finished difference Result 22333 states and 67063 transitions. [2019-12-18 22:52:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:52:08,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:52:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:08,842 INFO L225 Difference]: With dead ends: 22333 [2019-12-18 22:52:08,842 INFO L226 Difference]: Without dead ends: 22057 [2019-12-18 22:52:08,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:52:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22057 states. [2019-12-18 22:52:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22057 to 14167. [2019-12-18 22:52:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14167 states. [2019-12-18 22:52:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14167 states to 14167 states and 42762 transitions. [2019-12-18 22:52:09,109 INFO L78 Accepts]: Start accepts. Automaton has 14167 states and 42762 transitions. Word has length 56 [2019-12-18 22:52:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:09,109 INFO L462 AbstractCegarLoop]: Abstraction has 14167 states and 42762 transitions. [2019-12-18 22:52:09,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:52:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14167 states and 42762 transitions. [2019-12-18 22:52:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:52:09,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:09,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:09,124 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 2 times [2019-12-18 22:52:09,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:09,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553400257] [2019-12-18 22:52:09,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:52:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:52:09,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:52:09,294 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:52:09,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2348~0.base_19|) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2348~0.base_19| 4)) (= v_~z~0_10 0) (= |v_#valid_51| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_19| 1)) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$r_buff1_thd2~0_16 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2348~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2348~0.base_19|) |v_ULTIMATE.start_main_~#t2348~0.offset_15| 0)) |v_#memory_int_21|) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_19|)) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_15|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_19|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_21|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_21|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:52:09,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 22:52:09,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-18 22:52:09,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0~0_In171069150 ~x$w_buff1~0_Out171069150) (= ~x$w_buff0_used~0_Out171069150 1) (= ~x$w_buff0~0_Out171069150 1) (= P1Thread1of1ForFork0_~arg.offset_Out171069150 |P1Thread1of1ForFork0_#in~arg.offset_In171069150|) (= (mod ~x$w_buff1_used~0_Out171069150 256) 0) (= P1Thread1of1ForFork0_~arg.base_Out171069150 |P1Thread1of1ForFork0_#in~arg.base_In171069150|) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out171069150|) (= ~x$w_buff1_used~0_Out171069150 ~x$w_buff0_used~0_In171069150) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out171069150 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out171069150|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In171069150, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In171069150|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In171069150|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In171069150} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out171069150, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out171069150, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out171069150, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out171069150, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out171069150|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In171069150|, ~x$w_buff1~0=~x$w_buff1~0_Out171069150, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In171069150|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out171069150, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out171069150} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:52:09,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1800461652 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1800461652 256) 0))) (or (and (= ~x~0_In1800461652 |P2Thread1of1ForFork1_#t~ite32_Out1800461652|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1800461652| ~x$w_buff1~0_In1800461652) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1800461652, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1800461652, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1800461652, ~x~0=~x~0_In1800461652} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1800461652|, ~x$w_buff1~0=~x$w_buff1~0_In1800461652, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1800461652, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1800461652, ~x~0=~x~0_In1800461652} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:52:09,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:52:09,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-106722039 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-106722039 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-106722039|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-106722039 |P2Thread1of1ForFork1_#t~ite34_Out-106722039|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-106722039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106722039} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-106722039|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-106722039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106722039} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:52:09,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1878273688 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1878273688 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1878273688| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1878273688| ~x$w_buff0_used~0_In1878273688) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1878273688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1878273688} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1878273688, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1878273688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1878273688} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:52:09,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In322193892 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In322193892 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In322193892 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In322193892 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out322193892|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In322193892 |P1Thread1of1ForFork0_#t~ite29_Out322193892|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In322193892, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In322193892, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In322193892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In322193892} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In322193892, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In322193892, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In322193892, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out322193892|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In322193892} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:52:09,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-325593278 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-325593278 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-325593278) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-325593278 ~x$r_buff0_thd2~0_Out-325593278) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-325593278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325593278} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-325593278|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-325593278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325593278} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:52:09,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-862948519 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-862948519 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-862948519 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-862948519 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-862948519| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-862948519| ~x$r_buff1_thd2~0_In-862948519)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-862948519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-862948519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-862948519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862948519} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-862948519|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862948519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-862948519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-862948519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862948519} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:52:09,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:52:09,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1657256243 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1657256243 256)))) (or (= (mod ~x$w_buff0_used~0_In-1657256243 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1657256243 256)) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1657256243 256))))) (= ~x$w_buff1~0_In-1657256243 |P0Thread1of1ForFork2_#t~ite11_Out-1657256243|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1657256243| |P0Thread1of1ForFork2_#t~ite11_Out-1657256243|) .cse1) (and (= ~x$w_buff1~0_In-1657256243 |P0Thread1of1ForFork2_#t~ite12_Out-1657256243|) (= |P0Thread1of1ForFork2_#t~ite11_In-1657256243| |P0Thread1of1ForFork2_#t~ite11_Out-1657256243|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1657256243, ~x$w_buff1~0=~x$w_buff1~0_In-1657256243, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1657256243, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1657256243, ~weak$$choice2~0=~weak$$choice2~0_In-1657256243, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1657256243|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1657256243} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1657256243, ~x$w_buff1~0=~x$w_buff1~0_In-1657256243, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1657256243, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1657256243, ~weak$$choice2~0=~weak$$choice2~0_In-1657256243, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1657256243|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1657256243|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1657256243} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:52:09,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In722271858 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out722271858| |P0Thread1of1ForFork2_#t~ite14_Out722271858|) (= |P0Thread1of1ForFork2_#t~ite14_Out722271858| ~x$w_buff0_used~0_In722271858) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In722271858 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In722271858 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In722271858 256))) (= 0 (mod ~x$w_buff0_used~0_In722271858 256))))) (and (= |P0Thread1of1ForFork2_#t~ite15_Out722271858| ~x$w_buff0_used~0_In722271858) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In722271858| |P0Thread1of1ForFork2_#t~ite14_Out722271858|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In722271858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In722271858, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In722271858, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In722271858|, ~weak$$choice2~0=~weak$$choice2~0_In722271858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722271858} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In722271858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In722271858, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out722271858|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In722271858, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out722271858|, ~weak$$choice2~0=~weak$$choice2~0_In722271858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722271858} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:52:09,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-562502215 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-562502215 256) 0)) (.cse4 (= |P0Thread1of1ForFork2_#t~ite17_Out-562502215| |P0Thread1of1ForFork2_#t~ite18_Out-562502215|)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-562502215 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-562502215 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-562502215 256)))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse2 .cse3)) .cse4 (= ~x$w_buff1_used~0_In-562502215 |P0Thread1of1ForFork2_#t~ite17_Out-562502215|) .cse5) (and (= |P0Thread1of1ForFork2_#t~ite17_In-562502215| |P0Thread1of1ForFork2_#t~ite17_Out-562502215|) (= ~x$w_buff1_used~0_In-562502215 |P0Thread1of1ForFork2_#t~ite18_Out-562502215|) (not .cse5))) (= |P0Thread1of1ForFork2_#t~ite16_In-562502215| |P0Thread1of1ForFork2_#t~ite16_Out-562502215|)) (let ((.cse6 (not .cse2))) (and (= |P0Thread1of1ForFork2_#t~ite16_Out-562502215| 0) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite16_Out-562502215| |P0Thread1of1ForFork2_#t~ite17_Out-562502215|) (or .cse6 (not .cse1)) .cse4 (or .cse6 (not .cse3)) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-562502215, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-562502215|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-562502215, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-562502215|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-562502215, ~weak$$choice2~0=~weak$$choice2~0_In-562502215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-562502215} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-562502215, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-562502215|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-562502215|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-562502215, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-562502215|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-562502215, ~weak$$choice2~0=~weak$$choice2~0_In-562502215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-562502215} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:52:09,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:52:09,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-300441133| |P0Thread1of1ForFork2_#t~ite24_Out-300441133|)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-300441133 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-300441133 256))) (.cse0 (= (mod ~weak$$choice2~0_In-300441133 256) 0)) (.cse5 (= (mod ~x$w_buff1_used~0_In-300441133 256) 0)) (.cse4 (= 0 (mod ~x$r_buff0_thd1~0_In-300441133 256)))) (or (and (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-300441133| |P0Thread1of1ForFork2_#t~ite23_In-300441133|) (= |P0Thread1of1ForFork2_#t~ite24_Out-300441133| ~x$r_buff1_thd1~0_In-300441133) (not .cse0)) (and .cse1 (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5)) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-300441133| ~x$r_buff1_thd1~0_In-300441133))) (= |P0Thread1of1ForFork2_#t~ite22_In-300441133| |P0Thread1of1ForFork2_#t~ite22_Out-300441133|)) (let ((.cse6 (not .cse4))) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-300441133| |P0Thread1of1ForFork2_#t~ite22_Out-300441133|) .cse1 (or .cse6 (not .cse3)) (not .cse2) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-300441133|) .cse0 (or .cse6 (not .cse5)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-300441133, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-300441133, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-300441133, ~weak$$choice2~0=~weak$$choice2~0_In-300441133, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-300441133|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-300441133|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300441133} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-300441133, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-300441133, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-300441133, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-300441133|, ~weak$$choice2~0=~weak$$choice2~0_In-300441133, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-300441133|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-300441133|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300441133} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:52:09,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:52:09,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In351693959 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In351693959 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In351693959 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In351693959 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out351693959| 0)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In351693959 |P2Thread1of1ForFork1_#t~ite35_Out351693959|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In351693959, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In351693959, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In351693959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351693959} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out351693959|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351693959, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In351693959, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In351693959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351693959} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:52:09,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1310240541 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1310240541 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1310240541| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out1310240541| ~x$r_buff0_thd3~0_In1310240541) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1310240541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1310240541} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1310240541|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1310240541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1310240541} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:52:09,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1457731980 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1457731980 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1457731980 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1457731980 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1457731980| ~x$r_buff1_thd3~0_In-1457731980) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1457731980|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1457731980, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1457731980, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1457731980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1457731980} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1457731980|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1457731980, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1457731980, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1457731980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1457731980} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:52:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:52:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:52:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In67248246 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In67248246 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out67248246| ~x$w_buff1~0_In67248246) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out67248246| ~x~0_In67248246) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In67248246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In67248246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In67248246, ~x~0=~x~0_In67248246} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out67248246|, ~x$w_buff1~0=~x$w_buff1~0_In67248246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In67248246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In67248246, ~x~0=~x~0_In67248246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:52:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:52:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In400547305 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In400547305 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out400547305| ~x$w_buff0_used~0_In400547305)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out400547305|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In400547305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In400547305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In400547305, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out400547305|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In400547305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:52:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In625079662 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In625079662 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In625079662 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In625079662 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out625079662| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out625079662| ~x$w_buff1_used~0_In625079662)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In625079662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In625079662, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In625079662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In625079662} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In625079662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In625079662, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In625079662, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out625079662|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In625079662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:52:09,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1304871858 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1304871858 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1304871858| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1304871858| ~x$r_buff0_thd0~0_In1304871858)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304871858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304871858} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304871858, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1304871858|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304871858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:52:09,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1536527834 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1536527834 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1536527834 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1536527834 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1536527834 |ULTIMATE.start_main_#t~ite46_Out-1536527834|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1536527834|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1536527834, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1536527834, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1536527834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1536527834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1536527834, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1536527834|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1536527834, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1536527834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1536527834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:52:09,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:52:09,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:52:09 BasicIcfg [2019-12-18 22:52:09,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:52:09,411 INFO L168 Benchmark]: Toolchain (without parser) took 71934.02 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,411 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.78 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,413 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,414 INFO L168 Benchmark]: RCFGBuilder took 850.50 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 105.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,414 INFO L168 Benchmark]: TraceAbstraction took 70136.82 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 105.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:52:09,417 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.78 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.50 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 105.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70136.82 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 105.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4714 SDtfs, 5834 SDslu, 16223 SDs, 0 SdLazy, 8883 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 60 SyntacticMatches, 17 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred 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: 26.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 154180 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 167131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...