/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:12,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:12,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:12,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:12,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:12,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:12,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:12,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:12,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:12,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:12,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:12,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:12,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:12,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:12,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:12,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:12,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:12,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:12,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:12,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:12,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:12,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:12,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:12,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:12,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:12,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:12,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:12,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:12,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:12,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:12,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:12,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:12,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:12,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:12,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:12,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:12,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:12,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:12,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:12,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:12,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:12,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:13:12,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:12,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:12,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:12,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:12,181 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:12,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:12,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:12,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:12,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:12,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:12,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:12,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:12,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:12,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:12,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:12,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:12,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:12,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:12,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:12,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:12,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:12,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:12,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:12,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:12,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:12,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:12,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:12,187 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:12,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:12,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:12,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:12,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:12,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:12,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:12,498 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:12,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-27 06:13:12,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77c28dc/c8e5524303724a1d964e0c009802e51e/FLAGa568afc63 [2019-12-27 06:13:13,055 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:13,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-27 06:13:13,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77c28dc/c8e5524303724a1d964e0c009802e51e/FLAGa568afc63 [2019-12-27 06:13:13,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77c28dc/c8e5524303724a1d964e0c009802e51e [2019-12-27 06:13:13,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:13,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:13,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:13,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:13,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:13,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:13" (1/1) ... [2019-12-27 06:13:13,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:13, skipping insertion in model container [2019-12-27 06:13:13,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:13" (1/1) ... [2019-12-27 06:13:13,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:13,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:13,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:13,983 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:14,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:14,161 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:14,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14 WrapperNode [2019-12-27 06:13:14,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:14,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:14,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:14,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:14,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:14,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:14,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:14,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:14,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... [2019-12-27 06:13:14,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:14,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:14,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:14,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:14,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:14,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:14,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:14,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:14,393 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:13:15,254 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:15,254 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:15,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:15 BoogieIcfgContainer [2019-12-27 06:13:15,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:15,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:15,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:15,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:15,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:13" (1/3) ... [2019-12-27 06:13:15,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6441e66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:15, skipping insertion in model container [2019-12-27 06:13:15,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:14" (2/3) ... [2019-12-27 06:13:15,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6441e66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:15, skipping insertion in model container [2019-12-27 06:13:15,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:15" (3/3) ... [2019-12-27 06:13:15,265 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-12-27 06:13:15,276 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:15,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:15,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:15,287 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:15,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,395 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:15,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:13:15,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:15,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:15,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:15,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:15,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:15,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:15,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:15,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:15,451 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 06:13:15,454 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:15,543 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:15,543 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:15,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:15,579 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:15,625 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:15,625 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:15,631 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:15,645 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:13:15,646 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:19,033 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 06:13:19,155 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:13:19,357 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:19,476 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:19,496 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 06:13:19,496 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 06:13:19,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 06:13:19,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 06:13:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 06:13:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:13:19,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:19,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:13:19,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 06:13:19,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:19,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556401152] [2019-12-27 06:13:19,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:20,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556401152] [2019-12-27 06:13:20,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:20,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:13:20,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485232380] [2019-12-27 06:13:20,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:20,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:20,213 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 06:13:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:20,493 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 06:13:20,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:20,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:13:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:20,578 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 06:13:20,578 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 06:13:20,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 06:13:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 06:13:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 06:13:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 06:13:21,097 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 06:13:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:21,098 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 06:13:21,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 06:13:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:13:21,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:21,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:21,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 06:13:21,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:21,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140718741] [2019-12-27 06:13:21,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:21,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140718741] [2019-12-27 06:13:21,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:21,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:21,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286470225] [2019-12-27 06:13:21,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:21,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:21,227 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 06:13:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:21,272 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 06:13:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:21,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:13:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:21,279 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 06:13:21,279 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 06:13:21,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 06:13:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 06:13:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 06:13:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 06:13:21,320 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 06:13:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:21,320 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 06:13:21,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 06:13:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:21,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:21,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:21,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 06:13:21,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:21,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257998582] [2019-12-27 06:13:21,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:21,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257998582] [2019-12-27 06:13:21,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:21,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:21,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866346684] [2019-12-27 06:13:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:21,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:21,441 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 06:13:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:21,526 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 06:13:21,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:21,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 06:13:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:21,537 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 06:13:21,537 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 06:13:21,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 06:13:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 06:13:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 06:13:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 06:13:21,585 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 06:13:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:21,585 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 06:13:21,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 06:13:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:21,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:21,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:21,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 06:13:21,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:21,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323400009] [2019-12-27 06:13:21,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:21,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323400009] [2019-12-27 06:13:21,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:21,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:21,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697865786] [2019-12-27 06:13:21,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:21,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:21,670 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 06:13:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:21,925 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 06:13:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:21,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:21,941 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 06:13:21,941 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 06:13:21,945 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-27 06:13:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 06:13:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 06:13:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 06:13:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 06:13:22,015 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 06:13:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:22,016 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 06:13:22,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 06:13:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:22,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:22,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:22,018 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 06:13:22,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:22,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088618977] [2019-12-27 06:13:22,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088618977] [2019-12-27 06:13:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:22,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616351193] [2019-12-27 06:13:22,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:22,197 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 06:13:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:22,384 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 06:13:22,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:22,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:22,407 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 06:13:22,407 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 06:13:22,408 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-27 06:13:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 06:13:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 06:13:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 06:13:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 06:13:22,459 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 06:13:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:22,460 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 06:13:22,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 06:13:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:13:22,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:22,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:22,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 06:13:22,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:22,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475366077] [2019-12-27 06:13:22,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:22,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475366077] [2019-12-27 06:13:22,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:22,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:22,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24943891] [2019-12-27 06:13:22,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:22,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:22,577 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 06:13:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:22,884 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 06:13:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:22,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:13:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:22,902 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 06:13:22,905 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 06:13:22,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 06:13:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 06:13:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 06:13:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 06:13:22,969 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 06:13:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:22,969 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 06:13:22,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 06:13:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:22,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:22,973 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-27 06:13:22,973 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 06:13:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:22,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586729328] [2019-12-27 06:13:22,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:23,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586729328] [2019-12-27 06:13:23,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:23,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:23,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108472102] [2019-12-27 06:13:23,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:23,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:23,064 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 4 states. [2019-12-27 06:13:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:23,088 INFO L93 Difference]: Finished difference Result 1117 states and 2441 transitions. [2019-12-27 06:13:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:23,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 06:13:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:23,092 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 06:13:23,092 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 06:13:23,093 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-27 06:13:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 06:13:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1059. [2019-12-27 06:13:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 06:13:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2334 transitions. [2019-12-27 06:13:23,118 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2334 transitions. Word has length 26 [2019-12-27 06:13:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:23,119 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2334 transitions. [2019-12-27 06:13:23,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2334 transitions. [2019-12-27 06:13:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:23,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:23,123 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-27 06:13:23,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 06:13:23,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:23,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077996794] [2019-12-27 06:13:23,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:23,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077996794] [2019-12-27 06:13:23,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:23,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:23,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510712026] [2019-12-27 06:13:23,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:23,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:23,233 INFO L87 Difference]: Start difference. First operand 1059 states and 2334 transitions. Second operand 5 states. [2019-12-27 06:13:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:23,454 INFO L93 Difference]: Finished difference Result 1193 states and 2576 transitions. [2019-12-27 06:13:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:23,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:13:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:23,460 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:13:23,460 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:13:23,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:13:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 955. [2019-12-27 06:13:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-27 06:13:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2121 transitions. [2019-12-27 06:13:23,490 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2121 transitions. Word has length 26 [2019-12-27 06:13:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:23,491 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 2121 transitions. [2019-12-27 06:13:23,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2121 transitions. [2019-12-27 06:13:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:23,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:23,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:23,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash 15300526, now seen corresponding path program 1 times [2019-12-27 06:13:23,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:23,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382603038] [2019-12-27 06:13:23,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:23,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382603038] [2019-12-27 06:13:23,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:23,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:23,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663929463] [2019-12-27 06:13:23,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:23,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:23,719 INFO L87 Difference]: Start difference. First operand 955 states and 2121 transitions. Second operand 7 states. [2019-12-27 06:13:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:24,105 INFO L93 Difference]: Finished difference Result 2800 states and 6130 transitions. [2019-12-27 06:13:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:13:24,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:13:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:24,115 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 06:13:24,115 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 06:13:24,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:13:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 06:13:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1056. [2019-12-27 06:13:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 06:13:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2353 transitions. [2019-12-27 06:13:24,160 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2353 transitions. Word has length 51 [2019-12-27 06:13:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:24,163 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2353 transitions. [2019-12-27 06:13:24,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2353 transitions. [2019-12-27 06:13:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:24,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:24,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:24,169 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:24,170 INFO L82 PathProgramCache]: Analyzing trace with hash -671171562, now seen corresponding path program 2 times [2019-12-27 06:13:24,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:24,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807285924] [2019-12-27 06:13:24,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:24,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807285924] [2019-12-27 06:13:24,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:24,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:24,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885193633] [2019-12-27 06:13:24,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:24,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:24,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:24,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:24,278 INFO L87 Difference]: Start difference. First operand 1056 states and 2353 transitions. Second operand 4 states. [2019-12-27 06:13:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:24,313 INFO L93 Difference]: Finished difference Result 1633 states and 3700 transitions. [2019-12-27 06:13:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:24,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 06:13:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:24,316 INFO L225 Difference]: With dead ends: 1633 [2019-12-27 06:13:24,316 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 06:13:24,317 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-27 06:13:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 06:13:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-12-27 06:13:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-27 06:13:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1432 transitions. [2019-12-27 06:13:24,333 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1432 transitions. Word has length 51 [2019-12-27 06:13:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:24,333 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1432 transitions. [2019-12-27 06:13:24,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1432 transitions. [2019-12-27 06:13:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:24,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:24,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:24,337 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:24,337 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 3 times [2019-12-27 06:13:24,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:24,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910728786] [2019-12-27 06:13:24,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:24,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910728786] [2019-12-27 06:13:24,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:24,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:13:24,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201985054] [2019-12-27 06:13:24,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:24,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:24,472 INFO L87 Difference]: Start difference. First operand 622 states and 1432 transitions. Second operand 5 states. [2019-12-27 06:13:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:24,732 INFO L93 Difference]: Finished difference Result 743 states and 1651 transitions. [2019-12-27 06:13:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:13:24,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 06:13:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:24,735 INFO L225 Difference]: With dead ends: 743 [2019-12-27 06:13:24,735 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 06:13:24,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:13:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 06:13:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2019-12-27 06:13:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-27 06:13:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1584 transitions. [2019-12-27 06:13:24,759 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1584 transitions. Word has length 51 [2019-12-27 06:13:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:24,760 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1584 transitions. [2019-12-27 06:13:24,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1584 transitions. [2019-12-27 06:13:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:24,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:24,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:24,764 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash 440616472, now seen corresponding path program 4 times [2019-12-27 06:13:24,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:24,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473274193] [2019-12-27 06:13:24,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:24,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473274193] [2019-12-27 06:13:24,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:24,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:24,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163864271] [2019-12-27 06:13:24,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:24,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:24,926 INFO L87 Difference]: Start difference. First operand 705 states and 1584 transitions. Second operand 3 states. [2019-12-27 06:13:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:24,940 INFO L93 Difference]: Finished difference Result 704 states and 1582 transitions. [2019-12-27 06:13:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:24,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:13:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:24,943 INFO L225 Difference]: With dead ends: 704 [2019-12-27 06:13:24,943 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 06:13:24,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 06:13:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 631. [2019-12-27 06:13:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 06:13:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1452 transitions. [2019-12-27 06:13:24,958 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1452 transitions. Word has length 51 [2019-12-27 06:13:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:24,959 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1452 transitions. [2019-12-27 06:13:24,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1452 transitions. [2019-12-27 06:13:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:13:24,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:24,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:24,961 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 578834260, now seen corresponding path program 1 times [2019-12-27 06:13:24,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:24,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402804255] [2019-12-27 06:13:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:25,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402804255] [2019-12-27 06:13:25,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:25,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:13:25,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557976198] [2019-12-27 06:13:25,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:13:25,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:13:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:13:25,148 INFO L87 Difference]: Start difference. First operand 631 states and 1452 transitions. Second operand 8 states. [2019-12-27 06:13:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:25,870 INFO L93 Difference]: Finished difference Result 1037 states and 2202 transitions. [2019-12-27 06:13:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:13:25,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 06:13:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:25,873 INFO L225 Difference]: With dead ends: 1037 [2019-12-27 06:13:25,873 INFO L226 Difference]: Without dead ends: 1037 [2019-12-27 06:13:25,874 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-27 06:13:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-27 06:13:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 746. [2019-12-27 06:13:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 06:13:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1598 transitions. [2019-12-27 06:13:25,894 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1598 transitions. Word has length 52 [2019-12-27 06:13:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:25,894 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1598 transitions. [2019-12-27 06:13:25,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:13:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1598 transitions. [2019-12-27 06:13:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:13:25,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:25,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:25,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:25,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash -717714874, now seen corresponding path program 2 times [2019-12-27 06:13:25,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:25,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644833103] [2019-12-27 06:13:25,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:26,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644833103] [2019-12-27 06:13:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:26,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:26,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075620422] [2019-12-27 06:13:26,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:26,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:26,022 INFO L87 Difference]: Start difference. First operand 746 states and 1598 transitions. Second operand 4 states. [2019-12-27 06:13:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:26,086 INFO L93 Difference]: Finished difference Result 910 states and 1926 transitions. [2019-12-27 06:13:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:26,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 06:13:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:26,088 INFO L225 Difference]: With dead ends: 910 [2019-12-27 06:13:26,089 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 06:13:26,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 06:13:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 760. [2019-12-27 06:13:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 06:13:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1629 transitions. [2019-12-27 06:13:26,109 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1629 transitions. Word has length 52 [2019-12-27 06:13:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:26,111 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1629 transitions. [2019-12-27 06:13:26,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1629 transitions. [2019-12-27 06:13:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:26,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:26,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:26,114 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1517325742, now seen corresponding path program 1 times [2019-12-27 06:13:26,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:26,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560484325] [2019-12-27 06:13:26,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:26,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560484325] [2019-12-27 06:13:26,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:26,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:26,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355681126] [2019-12-27 06:13:26,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:26,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:26,215 INFO L87 Difference]: Start difference. First operand 760 states and 1629 transitions. Second operand 7 states. [2019-12-27 06:13:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:26,490 INFO L93 Difference]: Finished difference Result 1893 states and 3893 transitions. [2019-12-27 06:13:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:13:26,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 06:13:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:26,497 INFO L225 Difference]: With dead ends: 1893 [2019-12-27 06:13:26,497 INFO L226 Difference]: Without dead ends: 1551 [2019-12-27 06:13:26,500 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-27 06:13:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-12-27 06:13:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 761. [2019-12-27 06:13:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 06:13:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1632 transitions. [2019-12-27 06:13:26,531 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1632 transitions. Word has length 53 [2019-12-27 06:13:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:26,531 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1632 transitions. [2019-12-27 06:13:26,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1632 transitions. [2019-12-27 06:13:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:26,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:26,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:26,534 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1731920874, now seen corresponding path program 2 times [2019-12-27 06:13:26,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:26,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333816420] [2019-12-27 06:13:26,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:26,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333816420] [2019-12-27 06:13:26,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:26,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:26,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200834715] [2019-12-27 06:13:26,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:26,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:26,624 INFO L87 Difference]: Start difference. First operand 761 states and 1632 transitions. Second operand 4 states. [2019-12-27 06:13:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:26,842 INFO L93 Difference]: Finished difference Result 1268 states and 2713 transitions. [2019-12-27 06:13:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:26,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:26,845 INFO L225 Difference]: With dead ends: 1268 [2019-12-27 06:13:26,846 INFO L226 Difference]: Without dead ends: 1268 [2019-12-27 06:13:26,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 06:13:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2019-12-27 06:13:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 848. [2019-12-27 06:13:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-12-27 06:13:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1841 transitions. [2019-12-27 06:13:26,869 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1841 transitions. Word has length 53 [2019-12-27 06:13:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:26,870 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1841 transitions. [2019-12-27 06:13:26,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1841 transitions. [2019-12-27 06:13:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:26,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:26,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:26,873 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 912007604, now seen corresponding path program 3 times [2019-12-27 06:13:26,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:26,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012075475] [2019-12-27 06:13:26,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012075475] [2019-12-27 06:13:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:26,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:26,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808080411] [2019-12-27 06:13:26,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:26,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:26,935 INFO L87 Difference]: Start difference. First operand 848 states and 1841 transitions. Second operand 4 states. [2019-12-27 06:13:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:27,124 INFO L93 Difference]: Finished difference Result 1148 states and 2459 transitions. [2019-12-27 06:13:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:27,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:27,127 INFO L225 Difference]: With dead ends: 1148 [2019-12-27 06:13:27,127 INFO L226 Difference]: Without dead ends: 1148 [2019-12-27 06:13:27,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 06:13:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-12-27 06:13:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 822. [2019-12-27 06:13:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-27 06:13:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1789 transitions. [2019-12-27 06:13:27,149 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1789 transitions. Word has length 53 [2019-12-27 06:13:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:27,149 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1789 transitions. [2019-12-27 06:13:27,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1789 transitions. [2019-12-27 06:13:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:27,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:27,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:27,152 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 444800354, now seen corresponding path program 4 times [2019-12-27 06:13:27,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468217485] [2019-12-27 06:13:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:27,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468217485] [2019-12-27 06:13:27,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162690566] [2019-12-27 06:13:27,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:13:27,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:13:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:13:27,250 INFO L87 Difference]: Start difference. First operand 822 states and 1789 transitions. Second operand 6 states. [2019-12-27 06:13:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:27,488 INFO L93 Difference]: Finished difference Result 1173 states and 2510 transitions. [2019-12-27 06:13:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:27,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 06:13:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:27,492 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 06:13:27,492 INFO L226 Difference]: Without dead ends: 1173 [2019-12-27 06:13:27,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:13:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-12-27 06:13:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2019-12-27 06:13:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-27 06:13:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1659 transitions. [2019-12-27 06:13:27,512 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1659 transitions. Word has length 53 [2019-12-27 06:13:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:27,512 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1659 transitions. [2019-12-27 06:13:27,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:13:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1659 transitions. [2019-12-27 06:13:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:27,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:27,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:27,515 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 06:13:27,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:27,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076812205] [2019-12-27 06:13:27,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:27,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:13:27,627 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:13:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_ULTIMATE.start_main_~#t841~0.offset_19| 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= (store .cse0 |v_ULTIMATE.start_main_~#t841~0.base_25| 1) |v_#valid_54|) (= 0 v_~a$r_buff1_thd2~0_49) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t841~0.base_25|)) (= 0 v_~a$w_buff0_used~0_103) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t841~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t841~0.base_25|) |v_ULTIMATE.start_main_~#t841~0.offset_19| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t841~0.base_25|) (= |v_#NULL.offset_2| 0) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t841~0.base_25| 4) |v_#length_19|) (= v_~a~0_24 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= 0 |v_#NULL.base_2|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t841~0.base=|v_ULTIMATE.start_main_~#t841~0.base_25|, #length=|v_#length_19|, ULTIMATE.start_main_~#t841~0.offset=|v_ULTIMATE.start_main_~#t841~0.offset_19|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t842~0.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t841~0.base, #length, ULTIMATE.start_main_~#t841~0.offset, ~y~0, ULTIMATE.start_main_~#t842~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:13:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 0 (mod ~a$w_buff1_used~0_Out741712483 256)) (= |P0Thread1of1ForFork0_#in~arg.offset_In741712483| P0Thread1of1ForFork0_~arg.offset_Out741712483) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out741712483|) (= ~a$w_buff0_used~0_In741712483 ~a$w_buff1_used~0_Out741712483) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out741712483| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out741712483) (= ~a$w_buff0~0_In741712483 ~a$w_buff1~0_Out741712483) (= P0Thread1of1ForFork0_~arg.base_Out741712483 |P0Thread1of1ForFork0_#in~arg.base_In741712483|) (= 1 ~a$w_buff0~0_Out741712483) (= 1 ~a$w_buff0_used~0_Out741712483)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In741712483|, ~a$w_buff0~0=~a$w_buff0~0_In741712483, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In741712483|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In741712483} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In741712483|, ~a$w_buff1~0=~a$w_buff1~0_Out741712483, ~a$w_buff0~0=~a$w_buff0~0_Out741712483, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out741712483, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In741712483|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out741712483, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out741712483, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out741712483, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out741712483|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out741712483} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:13:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t842~0.base_10| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10|) 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10| 1) |v_#valid_19|) (= |v_ULTIMATE.start_main_~#t842~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10|) |v_ULTIMATE.start_main_~#t842~0.offset_9| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t842~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t842~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t842~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t842~0.offset, #length] because there is no mapped edge [2019-12-27 06:13:27,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1177132072 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In1177132072| |P1Thread1of1ForFork1_#t~ite23_Out1177132072|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1177132072| ~a$w_buff1_used~0_In1177132072)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1177132072| ~a$w_buff1_used~0_In1177132072) (= |P1Thread1of1ForFork1_#t~ite23_Out1177132072| |P1Thread1of1ForFork1_#t~ite24_Out1177132072|) (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1177132072 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1177132072 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1177132072 256))) (and (= (mod ~a$w_buff1_used~0_In1177132072 256) 0) .cse1))) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1177132072, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1177132072, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1177132072|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1177132072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1177132072, ~weak$$choice2~0=~weak$$choice2~0_In1177132072} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1177132072, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1177132072|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1177132072, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1177132072|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1177132072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1177132072, ~weak$$choice2~0=~weak$$choice2~0_In1177132072} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 06:13:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:13:27,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-579303877 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-579303877 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-579303877| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-579303877| ~a$w_buff0_used~0_In-579303877)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-579303877, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-579303877} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-579303877|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-579303877, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-579303877} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:13:27,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1329302807 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1329302807 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1329302807 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1329302807 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1329302807| ~a$w_buff1_used~0_In-1329302807) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1329302807|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1329302807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1329302807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1329302807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1329302807} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1329302807|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1329302807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1329302807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1329302807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1329302807} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:13:27,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1375914091 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1375914091 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out1375914091 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out1375914091 ~a$r_buff0_thd1~0_In1375914091)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1375914091, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1375914091} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1375914091|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1375914091, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1375914091} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:13:27,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-256555333 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-256555333 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-256555333 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-256555333 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-256555333| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-256555333| ~a$r_buff1_thd1~0_In-256555333) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-256555333, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-256555333, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-256555333, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-256555333} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-256555333, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-256555333|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-256555333, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-256555333, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-256555333} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:13:27,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:13:27,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:13:27,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-782362464 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-782362464 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-782362464| |P1Thread1of1ForFork1_#t~ite32_Out-782362464|))) (or (and (not .cse0) (= ~a$w_buff1~0_In-782362464 |P1Thread1of1ForFork1_#t~ite32_Out-782362464|) (not .cse1) .cse2) (and (or .cse1 .cse0) (= ~a~0_In-782362464 |P1Thread1of1ForFork1_#t~ite32_Out-782362464|) .cse2))) InVars {~a~0=~a~0_In-782362464, ~a$w_buff1~0=~a$w_buff1~0_In-782362464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-782362464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-782362464} OutVars{~a~0=~a~0_In-782362464, ~a$w_buff1~0=~a$w_buff1~0_In-782362464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-782362464, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-782362464|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-782362464|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-782362464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:13:27,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1851170712 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1851170712 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1851170712| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1851170712| ~a$w_buff0_used~0_In1851170712)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1851170712, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1851170712} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1851170712|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1851170712, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1851170712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:13:27,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1094250179 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In1094250179 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1094250179 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1094250179 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1094250179 |P1Thread1of1ForFork1_#t~ite35_Out1094250179|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out1094250179| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1094250179, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1094250179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1094250179, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1094250179} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1094250179, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1094250179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1094250179, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1094250179|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1094250179} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:13:27,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1745539756 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1745539756 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1745539756 |P1Thread1of1ForFork1_#t~ite36_Out-1745539756|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1745539756|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1745539756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745539756} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1745539756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745539756, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1745539756|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:13:27,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1597707046 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1597707046 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1597707046 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1597707046 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1597707046|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd2~0_In1597707046 |P1Thread1of1ForFork1_#t~ite37_Out1597707046|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1597707046, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1597707046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1597707046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1597707046} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1597707046, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1597707046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1597707046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1597707046, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1597707046|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:27,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:27,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:13:27,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In409130265 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In409130265 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In409130265 |ULTIMATE.start_main_#t~ite40_Out409130265|)) (and (not .cse0) (= ~a$w_buff1~0_In409130265 |ULTIMATE.start_main_#t~ite40_Out409130265|) (not .cse1)))) InVars {~a~0=~a~0_In409130265, ~a$w_buff1~0=~a$w_buff1~0_In409130265, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In409130265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In409130265} OutVars{~a~0=~a~0_In409130265, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out409130265|, ~a$w_buff1~0=~a$w_buff1~0_In409130265, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In409130265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In409130265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:27,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:27,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In697662924 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In697662924 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In697662924 |ULTIMATE.start_main_#t~ite42_Out697662924|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out697662924|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In697662924, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In697662924} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In697662924, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In697662924, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out697662924|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:13:27,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1169260677 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1169260677 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1169260677 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1169260677 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1169260677| ~a$w_buff1_used~0_In1169260677)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1169260677| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1169260677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1169260677, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1169260677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1169260677} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1169260677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1169260677, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1169260677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1169260677, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1169260677|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:13:27,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In952959263 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In952959263 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out952959263|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out952959263| ~a$r_buff0_thd0~0_In952959263)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In952959263, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In952959263} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In952959263, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In952959263, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out952959263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:13:27,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-1915005568 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1915005568 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1915005568 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1915005568 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1915005568| ~a$r_buff1_thd0~0_In-1915005568) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1915005568| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1915005568, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1915005568, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1915005568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1915005568} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1915005568, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1915005568, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1915005568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1915005568, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1915005568|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:13:27,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:13:27,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:13:27 BasicIcfg [2019-12-27 06:13:27,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:13:27,753 INFO L168 Benchmark]: Toolchain (without parser) took 14377.92 ms. Allocated memory was 137.9 MB in the beginning and 465.0 MB in the end (delta: 327.2 MB). Free memory was 101.1 MB in the beginning and 255.6 MB in the end (delta: -154.4 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,754 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.14 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 155.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 200.8 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,756 INFO L168 Benchmark]: Boogie Preprocessor took 70.77 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,756 INFO L168 Benchmark]: RCFGBuilder took 957.52 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 105.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,757 INFO L168 Benchmark]: TraceAbstraction took 12492.36 ms. Allocated memory was 200.8 MB in the beginning and 465.0 MB in the end (delta: 264.2 MB). Free memory was 104.8 MB in the beginning and 255.6 MB in the end (delta: -150.7 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:27,760 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.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.14 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 155.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 200.8 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.77 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 957.52 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 105.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12492.36 ms. Allocated memory was 200.8 MB in the beginning and 465.0 MB in the end (delta: 264.2 MB). Free memory was 104.8 MB in the beginning and 255.6 MB in the end (delta: -150.7 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2090 SDtfs, 2218 SDslu, 4102 SDs, 0 SdLazy, 2241 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred 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: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 101932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...