/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:14:33,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:14:33,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:14:33,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:14:33,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:14:33,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:14:33,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:14:33,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:14:33,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:14:33,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:14:33,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:14:33,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:14:33,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:14:33,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:14:33,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:14:33,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:14:33,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:14:33,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:14:33,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:14:33,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:14:33,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:14:33,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:14:33,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:14:33,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:14:33,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:14:33,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:14:33,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:14:33,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:14:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:14:33,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:14:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:14:33,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:14:33,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:14:33,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:14:33,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:14:33,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:14:33,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:14:33,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:14:33,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:14:33,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:14:33,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:14:33,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:14:33,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:14:33,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:14:33,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:14:33,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:14:33,191 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:14:33,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:14:33,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:14:33,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:14:33,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:14:33,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:14:33,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:14:33,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:14:33,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:14:33,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:14:33,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:14:33,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:14:33,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:14:33,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:14:33,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:14:33,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:14:33,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:14:33,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:14:33,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:14:33,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:14:33,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:14:33,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:14:33,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:14:33,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:14:33,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:14:33,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:14:33,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:14:33,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:14:33,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:14:33,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:14:33,523 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:14:33,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2019-12-26 23:14:33,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6c0a9a9/ce07b4dfee9a477a910342b34c194809/FLAG19781ccf2 [2019-12-26 23:14:34,210 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:14:34,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2019-12-26 23:14:34,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6c0a9a9/ce07b4dfee9a477a910342b34c194809/FLAG19781ccf2 [2019-12-26 23:14:34,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6c0a9a9/ce07b4dfee9a477a910342b34c194809 [2019-12-26 23:14:34,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:14:34,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:14:34,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:34,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:14:34,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:14:34,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:34" (1/1) ... [2019-12-26 23:14:34,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a53daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:34, skipping insertion in model container [2019-12-26 23:14:34,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:34" (1/1) ... [2019-12-26 23:14:34,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:14:34,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:14:35,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:35,269 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:14:35,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:35,421 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:14:35,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35 WrapperNode [2019-12-26 23:14:35,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:35,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:35,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:14:35,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:14:35,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:35,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:14:35,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:14:35,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:14:35,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (1/1) ... [2019-12-26 23:14:35,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:14:35,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:14:35,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:14:35,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:14:35,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (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-26 23:14:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:14:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:14:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:14:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:14:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:14:35,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:14:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:14:35,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:14:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:14:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:14:35,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:14:35,617 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:14:36,317 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:14:36,317 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:14:36,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:36 BoogieIcfgContainer [2019-12-26 23:14:36,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:14:36,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:14:36,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:14:36,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:14:36,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:14:34" (1/3) ... [2019-12-26 23:14:36,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d12263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:36, skipping insertion in model container [2019-12-26 23:14:36,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:35" (2/3) ... [2019-12-26 23:14:36,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d12263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:36, skipping insertion in model container [2019-12-26 23:14:36,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:36" (3/3) ... [2019-12-26 23:14:36,327 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-12-26 23:14:36,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:14:36,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:14:36,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:14:36,347 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:14:36,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:36,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:14:36,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:14:36,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:14:36,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:14:36,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:14:36,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:14:36,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:14:36,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:14:36,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:14:36,486 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-26 23:14:36,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-26 23:14:36,592 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-26 23:14:36,592 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:36,607 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-26 23:14:36,631 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-26 23:14:36,674 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-26 23:14:36,674 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:36,681 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-26 23:14:36,696 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-26 23:14:36,697 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:14:41,466 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:14:41,578 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:14:41,612 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-26 23:14:41,613 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-26 23:14:41,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-26 23:14:41,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-26 23:14:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-26 23:14:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:14:41,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:41,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:14:41,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-26 23:14:41,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:41,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939600288] [2019-12-26 23:14:41,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:42,182 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-26 23:14:42,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939600288] [2019-12-26 23:14:42,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:14:42,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331497927] [2019-12-26 23:14:42,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:14:42,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:14:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:14:42,212 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-26 23:14:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:42,468 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-26 23:14:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:14:42,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:14:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:42,540 INFO L225 Difference]: With dead ends: 5990 [2019-12-26 23:14:42,541 INFO L226 Difference]: Without dead ends: 5642 [2019-12-26 23:14:42,542 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-26 23:14:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-26 23:14:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-26 23:14:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-26 23:14:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-26 23:14:42,948 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-26 23:14:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:42,949 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-26 23:14:42,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:14:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-26 23:14:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:14:42,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:42,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:42,958 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-26 23:14:42,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:42,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895812484] [2019-12-26 23:14:42,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895812484] [2019-12-26 23:14:43,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:43,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:14:43,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740793028] [2019-12-26 23:14:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:14:43,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:14:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:14:43,076 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 3 states. [2019-12-26 23:14:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:43,117 INFO L93 Difference]: Finished difference Result 1157 states and 2862 transitions. [2019-12-26 23:14:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:14:43,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:14:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:43,126 INFO L225 Difference]: With dead ends: 1157 [2019-12-26 23:14:43,126 INFO L226 Difference]: Without dead ends: 1157 [2019-12-26 23:14:43,127 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-26 23:14:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-26 23:14:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2019-12-26 23:14:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-26 23:14:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2862 transitions. [2019-12-26 23:14:43,163 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2862 transitions. Word has length 11 [2019-12-26 23:14:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:43,164 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 2862 transitions. [2019-12-26 23:14:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:14:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2862 transitions. [2019-12-26 23:14:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:14:43,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:43,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:43,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-26 23:14:43,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:43,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190601629] [2019-12-26 23:14:43,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:43,267 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-26 23:14:43,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190601629] [2019-12-26 23:14:43,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:43,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:14:43,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428766089] [2019-12-26 23:14:43,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:14:43,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:14:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:14:43,270 INFO L87 Difference]: Start difference. First operand 1157 states and 2862 transitions. Second operand 3 states. [2019-12-26 23:14:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:43,351 INFO L93 Difference]: Finished difference Result 1787 states and 4461 transitions. [2019-12-26 23:14:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:14:43,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:14:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:43,361 INFO L225 Difference]: With dead ends: 1787 [2019-12-26 23:14:43,362 INFO L226 Difference]: Without dead ends: 1787 [2019-12-26 23:14:43,362 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-26 23:14:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-12-26 23:14:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1271. [2019-12-26 23:14:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-26 23:14:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3173 transitions. [2019-12-26 23:14:43,417 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3173 transitions. Word has length 14 [2019-12-26 23:14:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:43,417 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3173 transitions. [2019-12-26 23:14:43,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:14:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3173 transitions. [2019-12-26 23:14:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:14:43,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:43,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:43,419 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-26 23:14:43,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:43,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237644897] [2019-12-26 23:14:43,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:43,524 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-26 23:14:43,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237644897] [2019-12-26 23:14:43,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:43,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:14:43,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029363173] [2019-12-26 23:14:43,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:14:43,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:14:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:14:43,529 INFO L87 Difference]: Start difference. First operand 1271 states and 3173 transitions. Second operand 4 states. [2019-12-26 23:14:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:43,702 INFO L93 Difference]: Finished difference Result 1720 states and 4173 transitions. [2019-12-26 23:14:43,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:14:43,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:14:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:43,715 INFO L225 Difference]: With dead ends: 1720 [2019-12-26 23:14:43,715 INFO L226 Difference]: Without dead ends: 1720 [2019-12-26 23:14:43,715 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-26 23:14:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-12-26 23:14:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1552. [2019-12-26 23:14:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-12-26 23:14:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3797 transitions. [2019-12-26 23:14:43,774 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3797 transitions. Word has length 14 [2019-12-26 23:14:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:43,775 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 3797 transitions. [2019-12-26 23:14:43,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:14:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3797 transitions. [2019-12-26 23:14:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:14:43,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:43,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:43,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-26 23:14:43,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:43,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951256610] [2019-12-26 23:14:43,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:43,851 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-26 23:14:43,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951256610] [2019-12-26 23:14:43,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:43,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:14:43,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849420490] [2019-12-26 23:14:43,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:14:43,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:14:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:14:43,854 INFO L87 Difference]: Start difference. First operand 1552 states and 3797 transitions. Second operand 4 states. [2019-12-26 23:14:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:43,998 INFO L93 Difference]: Finished difference Result 1981 states and 4771 transitions. [2019-12-26 23:14:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:14:44,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:14:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:44,011 INFO L225 Difference]: With dead ends: 1981 [2019-12-26 23:14:44,011 INFO L226 Difference]: Without dead ends: 1981 [2019-12-26 23:14:44,012 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-26 23:14:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-26 23:14:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1581. [2019-12-26 23:14:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-26 23:14:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3869 transitions. [2019-12-26 23:14:44,053 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3869 transitions. Word has length 14 [2019-12-26 23:14:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:44,053 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3869 transitions. [2019-12-26 23:14:44,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:14:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3869 transitions. [2019-12-26 23:14:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:14:44,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:44,057 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] [2019-12-26 23:14:44,057 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-26 23:14:44,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:44,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244862560] [2019-12-26 23:14:44,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:44,116 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-26 23:14:44,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244862560] [2019-12-26 23:14:44,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:44,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:14:44,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076349504] [2019-12-26 23:14:44,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:14:44,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:44,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:14:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:14:44,119 INFO L87 Difference]: Start difference. First operand 1581 states and 3869 transitions. Second operand 4 states. [2019-12-26 23:14:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:44,138 INFO L93 Difference]: Finished difference Result 702 states and 1600 transitions. [2019-12-26 23:14:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:14:44,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-26 23:14:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:44,143 INFO L225 Difference]: With dead ends: 702 [2019-12-26 23:14:44,143 INFO L226 Difference]: Without dead ends: 702 [2019-12-26 23:14:44,143 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-26 23:14:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-26 23:14:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 670. [2019-12-26 23:14:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-26 23:14:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1532 transitions. [2019-12-26 23:14:44,159 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1532 transitions. Word has length 26 [2019-12-26 23:14:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:44,160 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1532 transitions. [2019-12-26 23:14:44,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:14:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1532 transitions. [2019-12-26 23:14:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:44,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:44,163 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] [2019-12-26 23:14:44,163 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-26 23:14:44,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:44,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677212953] [2019-12-26 23:14:44,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:44,323 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-26 23:14:44,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677212953] [2019-12-26 23:14:44,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:44,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:14:44,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465607197] [2019-12-26 23:14:44,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:14:44,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:14:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:14:44,326 INFO L87 Difference]: Start difference. First operand 670 states and 1532 transitions. Second operand 6 states. [2019-12-26 23:14:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:44,568 INFO L93 Difference]: Finished difference Result 1768 states and 3997 transitions. [2019-12-26 23:14:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:14:44,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:14:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:44,575 INFO L225 Difference]: With dead ends: 1768 [2019-12-26 23:14:44,575 INFO L226 Difference]: Without dead ends: 1174 [2019-12-26 23:14:44,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:14:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-12-26 23:14:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 749. [2019-12-26 23:14:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-26 23:14:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1716 transitions. [2019-12-26 23:14:44,597 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1716 transitions. Word has length 41 [2019-12-26 23:14:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:44,600 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1716 transitions. [2019-12-26 23:14:44,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:14:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1716 transitions. [2019-12-26 23:14:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:44,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:44,605 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] [2019-12-26 23:14:44,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -367672255, now seen corresponding path program 2 times [2019-12-26 23:14:44,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:44,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998436731] [2019-12-26 23:14:44,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:44,691 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-26 23:14:44,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998436731] [2019-12-26 23:14:44,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:44,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:14:44,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124974896] [2019-12-26 23:14:44,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:14:44,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:14:44,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:14:44,694 INFO L87 Difference]: Start difference. First operand 749 states and 1716 transitions. Second operand 3 states. [2019-12-26 23:14:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:44,705 INFO L93 Difference]: Finished difference Result 1153 states and 2657 transitions. [2019-12-26 23:14:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:14:44,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:14:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:44,710 INFO L225 Difference]: With dead ends: 1153 [2019-12-26 23:14:44,710 INFO L226 Difference]: Without dead ends: 424 [2019-12-26 23:14:44,711 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-26 23:14:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-26 23:14:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-12-26 23:14:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-26 23:14:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 974 transitions. [2019-12-26 23:14:44,720 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 974 transitions. Word has length 41 [2019-12-26 23:14:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:44,721 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 974 transitions. [2019-12-26 23:14:44,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:14:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 974 transitions. [2019-12-26 23:14:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:44,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:44,722 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] [2019-12-26 23:14:44,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242661, now seen corresponding path program 3 times [2019-12-26 23:14:44,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:44,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105690870] [2019-12-26 23:14:44,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:44,918 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-26 23:14:44,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105690870] [2019-12-26 23:14:44,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:44,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:44,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882598790] [2019-12-26 23:14:44,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:14:44,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:14:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:14:44,919 INFO L87 Difference]: Start difference. First operand 424 states and 974 transitions. Second operand 8 states. [2019-12-26 23:14:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:45,451 INFO L93 Difference]: Finished difference Result 714 states and 1499 transitions. [2019-12-26 23:14:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:14:45,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-26 23:14:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:45,458 INFO L225 Difference]: With dead ends: 714 [2019-12-26 23:14:45,458 INFO L226 Difference]: Without dead ends: 714 [2019-12-26 23:14:45,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:14:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-26 23:14:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 539. [2019-12-26 23:14:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-26 23:14:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1139 transitions. [2019-12-26 23:14:45,473 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1139 transitions. Word has length 41 [2019-12-26 23:14:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:45,473 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1139 transitions. [2019-12-26 23:14:45,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:14:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1139 transitions. [2019-12-26 23:14:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:45,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:45,475 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] [2019-12-26 23:14:45,476 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 888874829, now seen corresponding path program 4 times [2019-12-26 23:14:45,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:45,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837085754] [2019-12-26 23:14:45,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:45,555 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-26 23:14:45,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837085754] [2019-12-26 23:14:45,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:45,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:14:45,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946589577] [2019-12-26 23:14:45,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:14:45,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:45,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:14:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:14:45,557 INFO L87 Difference]: Start difference. First operand 539 states and 1139 transitions. Second operand 7 states. [2019-12-26 23:14:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:45,751 INFO L93 Difference]: Finished difference Result 1307 states and 2699 transitions. [2019-12-26 23:14:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:14:45,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-26 23:14:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:45,758 INFO L225 Difference]: With dead ends: 1307 [2019-12-26 23:14:45,758 INFO L226 Difference]: Without dead ends: 976 [2019-12-26 23:14:45,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:14:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-26 23:14:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 538. [2019-12-26 23:14:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-26 23:14:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1139 transitions. [2019-12-26 23:14:45,775 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1139 transitions. Word has length 41 [2019-12-26 23:14:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:45,775 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1139 transitions. [2019-12-26 23:14:45,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:14:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1139 transitions. [2019-12-26 23:14:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:45,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:45,777 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] [2019-12-26 23:14:45,778 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1585763671, now seen corresponding path program 5 times [2019-12-26 23:14:45,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:45,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263895657] [2019-12-26 23:14:45,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:45,854 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-26 23:14:45,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263895657] [2019-12-26 23:14:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:14:45,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068117689] [2019-12-26 23:14:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:14:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:14:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:14:45,856 INFO L87 Difference]: Start difference. First operand 538 states and 1139 transitions. Second operand 6 states. [2019-12-26 23:14:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:46,281 INFO L93 Difference]: Finished difference Result 810 states and 1687 transitions. [2019-12-26 23:14:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:14:46,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:14:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:46,286 INFO L225 Difference]: With dead ends: 810 [2019-12-26 23:14:46,287 INFO L226 Difference]: Without dead ends: 810 [2019-12-26 23:14:46,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:14:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-12-26 23:14:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 554. [2019-12-26 23:14:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-26 23:14:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1171 transitions. [2019-12-26 23:14:46,300 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1171 transitions. Word has length 41 [2019-12-26 23:14:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:46,300 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1171 transitions. [2019-12-26 23:14:46,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:14:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1171 transitions. [2019-12-26 23:14:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:14:46,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:46,302 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] [2019-12-26 23:14:46,303 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash -101907359, now seen corresponding path program 6 times [2019-12-26 23:14:46,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:46,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911651538] [2019-12-26 23:14:46,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:46,371 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-26 23:14:46,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911651538] [2019-12-26 23:14:46,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:46,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:14:46,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449439714] [2019-12-26 23:14:46,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:14:46,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:14:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:14:46,374 INFO L87 Difference]: Start difference. First operand 554 states and 1171 transitions. Second operand 3 states. [2019-12-26 23:14:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:46,387 INFO L93 Difference]: Finished difference Result 552 states and 1166 transitions. [2019-12-26 23:14:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:14:46,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:14:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:46,396 INFO L225 Difference]: With dead ends: 552 [2019-12-26 23:14:46,396 INFO L226 Difference]: Without dead ends: 552 [2019-12-26 23:14:46,397 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-26 23:14:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-26 23:14:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 461. [2019-12-26 23:14:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-26 23:14:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 989 transitions. [2019-12-26 23:14:46,416 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 989 transitions. Word has length 41 [2019-12-26 23:14:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:46,416 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 989 transitions. [2019-12-26 23:14:46,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:14:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 989 transitions. [2019-12-26 23:14:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:14:46,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:46,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:46,418 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 1 times [2019-12-26 23:14:46,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:46,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332775093] [2019-12-26 23:14:46,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:14:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:14:46,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:14:46,526 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:14:46,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35|) 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35|) |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| 4)) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1633~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= (store .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_35|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1633~0.base=|v_ULTIMATE.start_main_~#t1633~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1633~0.offset=|v_ULTIMATE.start_main_~#t1633~0.offset_24|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1634~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1634~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1633~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1633~0.offset, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:14:46,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10|) |v_ULTIMATE.start_main_~#t1634~0.offset_9| 1)) |v_#memory_int_9|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1634~0.base_10|) (= |v_ULTIMATE.start_main_~#t1634~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1634~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1634~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1634~0.offset] because there is no mapped edge [2019-12-26 23:14:46,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff0_thd1~0_In-983253797 ~x$r_buff1_thd1~0_Out-983253797) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-983253797)) (= ~y~0_Out-983253797 ~__unbuffered_p1_EBX~0_Out-983253797) (= ~x$r_buff1_thd0~0_Out-983253797 ~x$r_buff0_thd0~0_In-983253797) (= ~x$r_buff0_thd2~0_Out-983253797 1) (= ~__unbuffered_p1_EAX~0_Out-983253797 ~y~0_Out-983253797) (= ~y~0_Out-983253797 1) (= ~x$r_buff1_thd2~0_Out-983253797 ~x$r_buff0_thd2~0_In-983253797)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-983253797, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-983253797, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-983253797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-983253797} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-983253797, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-983253797, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-983253797, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-983253797, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-983253797, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-983253797, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-983253797, ~y~0=~y~0_Out-983253797, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-983253797, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-983253797} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:14:46,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-26 23:14:46,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In563493388 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite24_Out563493388| ~x$r_buff1_thd1~0_In563493388) (= |P0Thread1of1ForFork1_#t~ite22_In563493388| |P0Thread1of1ForFork1_#t~ite22_Out563493388|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite23_In563493388| |P0Thread1of1ForFork1_#t~ite23_Out563493388|)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In563493388 256) 0)))) (and (= |P0Thread1of1ForFork1_#t~ite24_Out563493388| |P0Thread1of1ForFork1_#t~ite23_Out563493388|) (not (= (mod ~x$w_buff0_used~0_In563493388 256) 0)) (or (not (= (mod ~x$r_buff1_thd1~0_In563493388 256) 0)) .cse1) .cse0 (or .cse1 (not (= 0 (mod ~x$w_buff1_used~0_In563493388 256)))) (= |P0Thread1of1ForFork1_#t~ite23_Out563493388| |P0Thread1of1ForFork1_#t~ite22_Out563493388|) (= |P0Thread1of1ForFork1_#t~ite22_Out563493388| 0))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In563493388, ~x$w_buff1_used~0=~x$w_buff1_used~0_In563493388, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In563493388, ~weak$$choice2~0=~weak$$choice2~0_In563493388, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In563493388|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563493388, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In563493388|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In563493388, ~x$w_buff1_used~0=~x$w_buff1_used~0_In563493388, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In563493388, ~weak$$choice2~0=~weak$$choice2~0_In563493388, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out563493388|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out563493388|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out563493388|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563493388} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 23:14:46,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:14:46,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In576105626 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In576105626 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In576105626 |P1Thread1of1ForFork0_#t~ite28_Out576105626|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out576105626|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In576105626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576105626} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In576105626, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out576105626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576105626} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:14:46,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-133798787 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-133798787 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-133798787 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-133798787 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-133798787|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-133798787 |P1Thread1of1ForFork0_#t~ite29_Out-133798787|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-133798787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-133798787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-133798787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133798787} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-133798787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-133798787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-133798787, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-133798787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133798787} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:14:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1246092456 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1246092456 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1246092456 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out1246092456 ~x$r_buff0_thd2~0_In1246092456) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1246092456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1246092456} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1246092456|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1246092456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1246092456} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:14:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1001392937 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1001392937 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1001392937 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1001392937 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1001392937| ~x$r_buff1_thd2~0_In1001392937) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1001392937|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1001392937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1001392937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1001392937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1001392937} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1001392937|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1001392937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1001392937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1001392937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1001392937} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:14:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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-26 23:14:46,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:14:46,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1324922646 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1324922646 256) 0))) (or (and (= ~x~0_In-1324922646 |ULTIMATE.start_main_#t~ite34_Out-1324922646|) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In-1324922646 |ULTIMATE.start_main_#t~ite34_Out-1324922646|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1324922646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324922646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1324922646, ~x~0=~x~0_In-1324922646} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1324922646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324922646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1324922646, ~x~0=~x~0_In-1324922646, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1324922646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 23:14:46,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 23:14:46,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In431671939 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In431671939 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out431671939| 0)) (and (= ~x$w_buff0_used~0_In431671939 |ULTIMATE.start_main_#t~ite36_Out431671939|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In431671939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In431671939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In431671939, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out431671939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In431671939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 23:14:46,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In1581729482 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1581729482 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1581729482 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1581729482 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out1581729482| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1581729482| ~x$w_buff1_used~0_In1581729482)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1581729482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1581729482, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1581729482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581729482} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1581729482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1581729482, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1581729482|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1581729482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581729482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 23:14:46,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1375005540 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1375005540 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1375005540|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1375005540| ~x$r_buff0_thd0~0_In-1375005540)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1375005540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1375005540} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1375005540, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1375005540|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1375005540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 23:14:46,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1642616189 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1642616189 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1642616189 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1642616189 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1642616189|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1642616189 |ULTIMATE.start_main_#t~ite39_Out1642616189|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1642616189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1642616189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1642616189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1642616189} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1642616189, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1642616189|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1642616189, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1642616189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1642616189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 23:14:46,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_42 2) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:14:46,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:14:46 BasicIcfg [2019-12-26 23:14:46,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:14:46,642 INFO L168 Benchmark]: Toolchain (without parser) took 12106.60 ms. Allocated memory was 135.3 MB in the beginning and 411.0 MB in the end (delta: 275.8 MB). Free memory was 98.0 MB in the beginning and 254.2 MB in the end (delta: -156.2 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,644 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.65 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 97.8 MB in the beginning and 153.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 198.7 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,647 INFO L168 Benchmark]: Boogie Preprocessor took 51.08 ms. Allocated memory is still 198.7 MB. Free memory was 150.7 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,649 INFO L168 Benchmark]: RCFGBuilder took 773.26 ms. Allocated memory is still 198.7 MB. Free memory was 148.5 MB in the beginning and 107.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,649 INFO L168 Benchmark]: TraceAbstraction took 10315.40 ms. Allocated memory was 198.7 MB in the beginning and 411.0 MB in the end (delta: 212.3 MB). Free memory was 106.4 MB in the beginning and 254.2 MB in the end (delta: -147.8 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:46,660 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 889.65 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 97.8 MB in the beginning and 153.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 198.7 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.08 ms. Allocated memory is still 198.7 MB. Free memory was 150.7 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.26 ms. Allocated memory is still 198.7 MB. Free memory was 148.5 MB in the beginning and 107.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10315.40 ms. Allocated memory was 198.7 MB in the beginning and 411.0 MB in the end (delta: 212.3 MB). Free memory was 106.4 MB in the beginning and 254.2 MB in the end (delta: -147.8 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L736] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L736] 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) [L737] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L737] 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)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L738] 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)) [L739] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L739] 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)) [L740] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] 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)) [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [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 [L808] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1370 SDtfs, 1145 SDslu, 2682 SDs, 0 SdLazy, 1376 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6150occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...