/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:56:50,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:56:50,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:56:50,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:56:50,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:56:50,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:56:50,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:56:50,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:56:50,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:56:50,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:56:50,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:56:50,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:56:50,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:56:50,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:56:50,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:56:50,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:56:50,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:56:50,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:56:50,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:56:50,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:56:50,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:56:50,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:56:50,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:56:50,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:56:50,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:56:50,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:56:50,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:56:50,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:56:50,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:56:50,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:56:50,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:56:50,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:56:50,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:56:50,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:56:50,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:56:50,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:56:50,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:56:50,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:56:50,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:56:50,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:56:50,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:56:50,133 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 07:56:50,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:56:50,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:56:50,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:56:50,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:56:50,149 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:56:50,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:56:50,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:56:50,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:56:50,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:56:50,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:56:50,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:56:50,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:56:50,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:56:50,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:56:50,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:56:50,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:56:50,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:56:50,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:56:50,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:56:50,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:56:50,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:56:50,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:56:50,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:56:50,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:56:50,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:56:50,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:56:50,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:56:50,154 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:56:50,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:56:50,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:56:50,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:56:50,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:56:50,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:56:50,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:56:50,457 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:56:50,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 07:56:50,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b756e97/a9f19dfa358b4a67bc03601a538ae673/FLAG0fe136102 [2019-12-27 07:56:51,074 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:56:51,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 07:56:51,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b756e97/a9f19dfa358b4a67bc03601a538ae673/FLAG0fe136102 [2019-12-27 07:56:51,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b756e97/a9f19dfa358b4a67bc03601a538ae673 [2019-12-27 07:56:51,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:56:51,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:56:51,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:56:51,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:56:51,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:56:51,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:56:51" (1/1) ... [2019-12-27 07:56:51,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b5cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:51, skipping insertion in model container [2019-12-27 07:56:51,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:56:51" (1/1) ... [2019-12-27 07:56:51,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:56:51,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:56:52,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:56:52,084 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:56:52,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:56:52,227 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:56:52,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52 WrapperNode [2019-12-27 07:56:52,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:56:52,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:56:52,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:56:52,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:56:52,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:56:52,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:56:52,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:56:52,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:56:52,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (1/1) ... [2019-12-27 07:56:52,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:56:52,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:56:52,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:56:52,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:56:52,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (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 07:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:56:52,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:56:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:56:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:56:52,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:56:52,400 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 07:56:53,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:56:53,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:56:53,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:56:53 BoogieIcfgContainer [2019-12-27 07:56:53,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:56:53,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:56:53,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:56:53,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:56:53,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:56:51" (1/3) ... [2019-12-27 07:56:53,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:56:53, skipping insertion in model container [2019-12-27 07:56:53,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:56:52" (2/3) ... [2019-12-27 07:56:53,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:56:53, skipping insertion in model container [2019-12-27 07:56:53,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:56:53" (3/3) ... [2019-12-27 07:56:53,162 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2019-12-27 07:56:53,173 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:56:53,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:56:53,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:56:53,185 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:56:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,291 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:56:53,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:56:53,334 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:56:53,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:56:53,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:56:53,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:56:53,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:56:53,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:56:53,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:56:53,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:56:53,352 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 07:56:53,354 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:56:53,462 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:56:53,463 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:56:53,477 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:56:53,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:56:53,553 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:56:53,553 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:56:53,561 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:56:53,581 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:56:53,582 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:56:57,369 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 07:56:57,511 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:56:57,535 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 07:56:57,536 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 07:56:57,539 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 07:57:09,135 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 07:57:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 07:57:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:57:09,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:09,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:57:09,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 07:57:09,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:09,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983827981] [2019-12-27 07:57:09,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:09,418 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 07:57:09,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983827981] [2019-12-27 07:57:09,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:09,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:57:09,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270193424] [2019-12-27 07:57:09,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:57:09,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:57:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:57:09,438 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 07:57:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:12,430 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 07:57:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:57:12,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:57:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:13,007 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 07:57:13,007 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 07:57:13,009 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 07:57:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 07:57:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 07:57:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 07:57:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 07:57:22,806 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 07:57:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:22,807 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 07:57:22,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:57:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 07:57:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:57:22,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:22,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:22,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 07:57:22,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:22,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071383468] [2019-12-27 07:57:22,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:22,968 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 07:57:22,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071383468] [2019-12-27 07:57:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:57:22,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641062595] [2019-12-27 07:57:22,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:57:22,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:57:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:57:22,971 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 07:57:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:23,875 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 07:57:23,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:57:23,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:57:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:25,116 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 07:57:25,116 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 07:57:25,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 07:57:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 07:57:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 07:57:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 07:57:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 07:57:35,042 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 07:57:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:35,043 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 07:57:35,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:57:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 07:57:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:57:35,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:35,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:35,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 07:57:35,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:35,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908428251] [2019-12-27 07:57:35,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:35,115 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 07:57:35,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908428251] [2019-12-27 07:57:35,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:35,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:57:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047335240] [2019-12-27 07:57:35,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:57:35,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:57:35,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:57:35,117 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 07:57:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:35,221 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 07:57:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:57:35,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:57:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:35,277 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 07:57:35,277 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 07:57:35,277 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 07:57:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 07:57:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 07:57:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 07:57:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 07:57:39,399 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 07:57:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:39,399 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 07:57:39,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:57:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 07:57:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:57:39,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:39,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:39,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 07:57:39,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:39,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587124462] [2019-12-27 07:57:39,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:39,529 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 07:57:39,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587124462] [2019-12-27 07:57:39,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:39,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:57:39,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940519250] [2019-12-27 07:57:39,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:57:39,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:39,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:57:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:57:39,534 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 07:57:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:40,031 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 07:57:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:57:40,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 07:57:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:40,102 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 07:57:40,103 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 07:57:40,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:57:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 07:57:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 07:57:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 07:57:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 07:57:40,725 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 07:57:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:40,725 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 07:57:40,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:57:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 07:57:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:57:40,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:40,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:40,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 07:57:40,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:40,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974779440] [2019-12-27 07:57:40,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:40,917 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 07:57:40,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974779440] [2019-12-27 07:57:40,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:40,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:57:40,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21907241] [2019-12-27 07:57:40,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:57:40,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:57:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:57:40,920 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-27 07:57:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:42,246 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-27 07:57:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:57:42,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:57:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:42,331 INFO L225 Difference]: With dead ends: 48043 [2019-12-27 07:57:42,331 INFO L226 Difference]: Without dead ends: 48015 [2019-12-27 07:57:42,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:57:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-27 07:57:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-27 07:57:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-27 07:57:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-27 07:57:43,018 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-27 07:57:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:43,018 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-27 07:57:43,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:57:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-27 07:57:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:57:43,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:43,036 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 07:57:43,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 07:57:43,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:43,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410158936] [2019-12-27 07:57:43,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:43,094 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 07:57:43,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410158936] [2019-12-27 07:57:43,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:43,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:57:43,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632477012] [2019-12-27 07:57:43,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:57:43,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:57:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:57:43,097 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-27 07:57:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:43,153 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-27 07:57:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:57:43,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:57:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:43,176 INFO L225 Difference]: With dead ends: 12531 [2019-12-27 07:57:43,176 INFO L226 Difference]: Without dead ends: 12531 [2019-12-27 07:57:43,177 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 07:57:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-27 07:57:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-27 07:57:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-27 07:57:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-27 07:57:43,365 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-27 07:57:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:43,365 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-27 07:57:43,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:57:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-27 07:57:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:57:43,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:43,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:43,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-27 07:57:43,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:43,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695568734] [2019-12-27 07:57:43,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:43,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 07:57:43,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695568734] [2019-12-27 07:57:43,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:43,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:57:43,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862676727] [2019-12-27 07:57:43,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:57:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:57:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:57:43,472 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 5 states. [2019-12-27 07:57:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:43,540 INFO L93 Difference]: Finished difference Result 11113 states and 34299 transitions. [2019-12-27 07:57:43,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:57:43,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 07:57:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:43,558 INFO L225 Difference]: With dead ends: 11113 [2019-12-27 07:57:43,558 INFO L226 Difference]: Without dead ends: 11113 [2019-12-27 07:57:43,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:57:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-27 07:57:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10665. [2019-12-27 07:57:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-27 07:57:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 33035 transitions. [2019-12-27 07:57:43,902 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 33035 transitions. Word has length 39 [2019-12-27 07:57:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:43,903 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 33035 transitions. [2019-12-27 07:57:43,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:57:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 33035 transitions. [2019-12-27 07:57:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:43,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:43,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:43,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash 878583209, now seen corresponding path program 1 times [2019-12-27 07:57:43,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:43,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616883126] [2019-12-27 07:57:43,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:44,014 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 07:57:44,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616883126] [2019-12-27 07:57:44,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:44,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:57:44,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519017353] [2019-12-27 07:57:44,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:57:44,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:57:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:57:44,016 INFO L87 Difference]: Start difference. First operand 10665 states and 33035 transitions. Second operand 4 states. [2019-12-27 07:57:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:44,091 INFO L93 Difference]: Finished difference Result 19424 states and 60142 transitions. [2019-12-27 07:57:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:57:44,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 07:57:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:44,107 INFO L225 Difference]: With dead ends: 19424 [2019-12-27 07:57:44,107 INFO L226 Difference]: Without dead ends: 9092 [2019-12-27 07:57:44,107 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 07:57:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2019-12-27 07:57:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 9092. [2019-12-27 07:57:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9092 states. [2019-12-27 07:57:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9092 states to 9092 states and 28032 transitions. [2019-12-27 07:57:44,251 INFO L78 Accepts]: Start accepts. Automaton has 9092 states and 28032 transitions. Word has length 54 [2019-12-27 07:57:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:44,251 INFO L462 AbstractCegarLoop]: Abstraction has 9092 states and 28032 transitions. [2019-12-27 07:57:44,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:57:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9092 states and 28032 transitions. [2019-12-27 07:57:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:44,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:44,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:44,266 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash 546394411, now seen corresponding path program 2 times [2019-12-27 07:57:44,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:44,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027207790] [2019-12-27 07:57:44,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:44,375 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 07:57:44,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027207790] [2019-12-27 07:57:44,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:44,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:57:44,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571466588] [2019-12-27 07:57:44,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:57:44,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:57:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:57:44,378 INFO L87 Difference]: Start difference. First operand 9092 states and 28032 transitions. Second operand 7 states. [2019-12-27 07:57:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:44,748 INFO L93 Difference]: Finished difference Result 22341 states and 68728 transitions. [2019-12-27 07:57:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:57:44,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:57:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:44,772 INFO L225 Difference]: With dead ends: 22341 [2019-12-27 07:57:44,773 INFO L226 Difference]: Without dead ends: 17627 [2019-12-27 07:57:44,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:57:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2019-12-27 07:57:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 10818. [2019-12-27 07:57:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10818 states. [2019-12-27 07:57:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 33605 transitions. [2019-12-27 07:57:44,985 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 33605 transitions. Word has length 54 [2019-12-27 07:57:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:44,985 INFO L462 AbstractCegarLoop]: Abstraction has 10818 states and 33605 transitions. [2019-12-27 07:57:44,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:57:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 33605 transitions. [2019-12-27 07:57:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:45,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:45,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:45,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2052295147, now seen corresponding path program 3 times [2019-12-27 07:57:45,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:45,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903967592] [2019-12-27 07:57:45,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:45,102 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 07:57:45,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903967592] [2019-12-27 07:57:45,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:45,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:57:45,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553952953] [2019-12-27 07:57:45,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:57:45,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:45,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:57:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:57:45,104 INFO L87 Difference]: Start difference. First operand 10818 states and 33605 transitions. Second operand 7 states. [2019-12-27 07:57:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:45,459 INFO L93 Difference]: Finished difference Result 26816 states and 81414 transitions. [2019-12-27 07:57:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:57:45,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:57:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:45,486 INFO L225 Difference]: With dead ends: 26816 [2019-12-27 07:57:45,486 INFO L226 Difference]: Without dead ends: 19206 [2019-12-27 07:57:45,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:57:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-12-27 07:57:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 12570. [2019-12-27 07:57:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2019-12-27 07:57:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 38891 transitions. [2019-12-27 07:57:45,708 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 38891 transitions. Word has length 54 [2019-12-27 07:57:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:45,709 INFO L462 AbstractCegarLoop]: Abstraction has 12570 states and 38891 transitions. [2019-12-27 07:57:45,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:57:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 38891 transitions. [2019-12-27 07:57:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:45,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:45,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:45,726 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash -243349385, now seen corresponding path program 4 times [2019-12-27 07:57:45,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:45,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117794739] [2019-12-27 07:57:45,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:45,823 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 07:57:45,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117794739] [2019-12-27 07:57:45,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:45,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:57:45,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848636668] [2019-12-27 07:57:45,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:57:45,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:57:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:57:45,825 INFO L87 Difference]: Start difference. First operand 12570 states and 38891 transitions. Second operand 7 states. [2019-12-27 07:57:46,286 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 07:57:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:46,365 INFO L93 Difference]: Finished difference Result 24752 states and 76254 transitions. [2019-12-27 07:57:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:57:46,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:57:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:46,397 INFO L225 Difference]: With dead ends: 24752 [2019-12-27 07:57:46,397 INFO L226 Difference]: Without dead ends: 22870 [2019-12-27 07:57:46,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:57:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22870 states. [2019-12-27 07:57:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22870 to 12633. [2019-12-27 07:57:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12633 states. [2019-12-27 07:57:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 39160 transitions. [2019-12-27 07:57:46,650 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 39160 transitions. Word has length 54 [2019-12-27 07:57:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:46,650 INFO L462 AbstractCegarLoop]: Abstraction has 12633 states and 39160 transitions. [2019-12-27 07:57:46,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:57:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 39160 transitions. [2019-12-27 07:57:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:46,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:46,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:46,666 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash 647129887, now seen corresponding path program 1 times [2019-12-27 07:57:46,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:46,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823212935] [2019-12-27 07:57:46,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:46,724 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 07:57:46,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823212935] [2019-12-27 07:57:46,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:46,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:57:46,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056846606] [2019-12-27 07:57:46,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:57:46,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:57:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:57:46,726 INFO L87 Difference]: Start difference. First operand 12633 states and 39160 transitions. Second operand 3 states. [2019-12-27 07:57:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:46,849 INFO L93 Difference]: Finished difference Result 18808 states and 58234 transitions. [2019-12-27 07:57:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:57:46,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:57:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:46,887 INFO L225 Difference]: With dead ends: 18808 [2019-12-27 07:57:46,887 INFO L226 Difference]: Without dead ends: 18808 [2019-12-27 07:57:46,887 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 07:57:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18808 states. [2019-12-27 07:57:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18808 to 16456. [2019-12-27 07:57:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16456 states. [2019-12-27 07:57:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16456 states to 16456 states and 51479 transitions. [2019-12-27 07:57:47,300 INFO L78 Accepts]: Start accepts. Automaton has 16456 states and 51479 transitions. Word has length 54 [2019-12-27 07:57:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:47,300 INFO L462 AbstractCegarLoop]: Abstraction has 16456 states and 51479 transitions. [2019-12-27 07:57:47,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:57:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 16456 states and 51479 transitions. [2019-12-27 07:57:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:57:47,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:47,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:47,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1558398603, now seen corresponding path program 5 times [2019-12-27 07:57:47,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:47,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936486560] [2019-12-27 07:57:47,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:47,420 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 07:57:47,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936486560] [2019-12-27 07:57:47,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:47,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:57:47,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667028086] [2019-12-27 07:57:47,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:57:47,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:57:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:57:47,426 INFO L87 Difference]: Start difference. First operand 16456 states and 51479 transitions. Second operand 3 states. [2019-12-27 07:57:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:47,492 INFO L93 Difference]: Finished difference Result 13349 states and 40700 transitions. [2019-12-27 07:57:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:57:47,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:57:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:47,515 INFO L225 Difference]: With dead ends: 13349 [2019-12-27 07:57:47,515 INFO L226 Difference]: Without dead ends: 13349 [2019-12-27 07:57:47,515 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 07:57:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13349 states. [2019-12-27 07:57:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13349 to 12872. [2019-12-27 07:57:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-12-27 07:57:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 39150 transitions. [2019-12-27 07:57:47,695 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 39150 transitions. Word has length 54 [2019-12-27 07:57:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 39150 transitions. [2019-12-27 07:57:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:57:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 39150 transitions. [2019-12-27 07:57:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:57:47,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:47,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:47,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 07:57:47,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:47,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156255287] [2019-12-27 07:57:47,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:47,814 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 07:57:47,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156255287] [2019-12-27 07:57:47,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:47,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:57:47,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31201882] [2019-12-27 07:57:47,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:57:47,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:57:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:57:47,816 INFO L87 Difference]: Start difference. First operand 12872 states and 39150 transitions. Second operand 6 states. [2019-12-27 07:57:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:48,690 INFO L93 Difference]: Finished difference Result 20445 states and 60877 transitions. [2019-12-27 07:57:48,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:57:48,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 07:57:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:48,727 INFO L225 Difference]: With dead ends: 20445 [2019-12-27 07:57:48,727 INFO L226 Difference]: Without dead ends: 20297 [2019-12-27 07:57:48,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:57:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20297 states. [2019-12-27 07:57:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20297 to 16742. [2019-12-27 07:57:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-27 07:57:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 50459 transitions. [2019-12-27 07:57:49,279 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 50459 transitions. Word has length 55 [2019-12-27 07:57:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:49,279 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 50459 transitions. [2019-12-27 07:57:49,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:57:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 50459 transitions. [2019-12-27 07:57:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:57:49,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:49,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:49,303 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 41129598, now seen corresponding path program 2 times [2019-12-27 07:57:49,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:49,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208403934] [2019-12-27 07:57:49,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:49,405 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 07:57:49,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208403934] [2019-12-27 07:57:49,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:49,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:57:49,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000089187] [2019-12-27 07:57:49,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:57:49,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:49,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:57:49,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:57:49,408 INFO L87 Difference]: Start difference. First operand 16742 states and 50459 transitions. Second operand 7 states. [2019-12-27 07:57:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:50,241 INFO L93 Difference]: Finished difference Result 25121 states and 74006 transitions. [2019-12-27 07:57:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:57:50,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 07:57:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:50,275 INFO L225 Difference]: With dead ends: 25121 [2019-12-27 07:57:50,276 INFO L226 Difference]: Without dead ends: 25121 [2019-12-27 07:57:50,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:57:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25121 states. [2019-12-27 07:57:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25121 to 17944. [2019-12-27 07:57:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17944 states. [2019-12-27 07:57:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17944 states to 17944 states and 53943 transitions. [2019-12-27 07:57:50,582 INFO L78 Accepts]: Start accepts. Automaton has 17944 states and 53943 transitions. Word has length 55 [2019-12-27 07:57:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:50,582 INFO L462 AbstractCegarLoop]: Abstraction has 17944 states and 53943 transitions. [2019-12-27 07:57:50,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:57:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17944 states and 53943 transitions. [2019-12-27 07:57:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:57:50,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:50,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:50,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:50,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:50,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 3 times [2019-12-27 07:57:50,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:50,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636335425] [2019-12-27 07:57:50,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:51,285 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 07:57:51,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636335425] [2019-12-27 07:57:51,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:51,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:57:51,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723627629] [2019-12-27 07:57:51,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:57:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:57:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:57:51,288 INFO L87 Difference]: Start difference. First operand 17944 states and 53943 transitions. Second operand 18 states. [2019-12-27 07:57:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:55,438 INFO L93 Difference]: Finished difference Result 30987 states and 91566 transitions. [2019-12-27 07:57:55,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 07:57:55,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 07:57:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:55,474 INFO L225 Difference]: With dead ends: 30987 [2019-12-27 07:57:55,474 INFO L226 Difference]: Without dead ends: 26818 [2019-12-27 07:57:55,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=446, Invalid=1906, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 07:57:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26818 states. [2019-12-27 07:57:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26818 to 18704. [2019-12-27 07:57:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18704 states. [2019-12-27 07:57:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18704 states to 18704 states and 55920 transitions. [2019-12-27 07:57:55,792 INFO L78 Accepts]: Start accepts. Automaton has 18704 states and 55920 transitions. Word has length 55 [2019-12-27 07:57:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:55,793 INFO L462 AbstractCegarLoop]: Abstraction has 18704 states and 55920 transitions. [2019-12-27 07:57:55,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:57:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18704 states and 55920 transitions. [2019-12-27 07:57:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:57:55,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:55,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:55,811 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1593822048, now seen corresponding path program 4 times [2019-12-27 07:57:55,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:55,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033922710] [2019-12-27 07:57:55,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:55,867 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 07:57:55,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033922710] [2019-12-27 07:57:55,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:55,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:57:55,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89456514] [2019-12-27 07:57:55,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:57:55,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:57:55,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:57:55,869 INFO L87 Difference]: Start difference. First operand 18704 states and 55920 transitions. Second operand 3 states. [2019-12-27 07:57:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:57:55,936 INFO L93 Difference]: Finished difference Result 18702 states and 55915 transitions. [2019-12-27 07:57:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:57:55,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:57:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:57:55,961 INFO L225 Difference]: With dead ends: 18702 [2019-12-27 07:57:55,961 INFO L226 Difference]: Without dead ends: 18702 [2019-12-27 07:57:55,962 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 07:57:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18702 states. [2019-12-27 07:57:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18702 to 16948. [2019-12-27 07:57:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16948 states. [2019-12-27 07:57:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16948 states to 16948 states and 51047 transitions. [2019-12-27 07:57:56,223 INFO L78 Accepts]: Start accepts. Automaton has 16948 states and 51047 transitions. Word has length 55 [2019-12-27 07:57:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:57:56,224 INFO L462 AbstractCegarLoop]: Abstraction has 16948 states and 51047 transitions. [2019-12-27 07:57:56,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:57:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16948 states and 51047 transitions. [2019-12-27 07:57:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:57:56,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:57:56,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:57:56,242 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:57:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:57:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash 514390991, now seen corresponding path program 1 times [2019-12-27 07:57:56,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:57:56,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922162028] [2019-12-27 07:57:56,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:57:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:57:56,873 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 07:57:56,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922162028] [2019-12-27 07:57:56,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:57:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:57:56,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337620159] [2019-12-27 07:57:56,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:57:56,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:57:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:57:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:57:56,875 INFO L87 Difference]: Start difference. First operand 16948 states and 51047 transitions. Second operand 16 states. [2019-12-27 07:58:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:00,964 INFO L93 Difference]: Finished difference Result 30855 states and 91824 transitions. [2019-12-27 07:58:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 07:58:00,965 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 07:58:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:00,996 INFO L225 Difference]: With dead ends: 30855 [2019-12-27 07:58:00,997 INFO L226 Difference]: Without dead ends: 23223 [2019-12-27 07:58:00,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 07:58:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23223 states. [2019-12-27 07:58:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23223 to 17538. [2019-12-27 07:58:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17538 states. [2019-12-27 07:58:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17538 states to 17538 states and 52418 transitions. [2019-12-27 07:58:01,278 INFO L78 Accepts]: Start accepts. Automaton has 17538 states and 52418 transitions. Word has length 56 [2019-12-27 07:58:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:01,278 INFO L462 AbstractCegarLoop]: Abstraction has 17538 states and 52418 transitions. [2019-12-27 07:58:01,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:58:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17538 states and 52418 transitions. [2019-12-27 07:58:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:01,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:01,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:01,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:01,298 INFO L82 PathProgramCache]: Analyzing trace with hash 480817473, now seen corresponding path program 2 times [2019-12-27 07:58:01,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:01,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450122839] [2019-12-27 07:58:01,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:02,059 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 07:58:02,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450122839] [2019-12-27 07:58:02,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:02,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:58:02,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614819847] [2019-12-27 07:58:02,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:58:02,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:02,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:58:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:58:02,063 INFO L87 Difference]: Start difference. First operand 17538 states and 52418 transitions. Second operand 16 states. [2019-12-27 07:58:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:06,762 INFO L93 Difference]: Finished difference Result 29555 states and 86587 transitions. [2019-12-27 07:58:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 07:58:06,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 07:58:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:06,797 INFO L225 Difference]: With dead ends: 29555 [2019-12-27 07:58:06,797 INFO L226 Difference]: Without dead ends: 25544 [2019-12-27 07:58:06,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=2054, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 07:58:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25544 states. [2019-12-27 07:58:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25544 to 17962. [2019-12-27 07:58:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17962 states. [2019-12-27 07:58:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17962 states to 17962 states and 53281 transitions. [2019-12-27 07:58:07,323 INFO L78 Accepts]: Start accepts. Automaton has 17962 states and 53281 transitions. Word has length 56 [2019-12-27 07:58:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:07,323 INFO L462 AbstractCegarLoop]: Abstraction has 17962 states and 53281 transitions. [2019-12-27 07:58:07,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:58:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 17962 states and 53281 transitions. [2019-12-27 07:58:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:07,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:07,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:07,342 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash -445328555, now seen corresponding path program 3 times [2019-12-27 07:58:07,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:07,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189226431] [2019-12-27 07:58:07,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:08,003 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 07:58:08,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189226431] [2019-12-27 07:58:08,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:08,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:58:08,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640807845] [2019-12-27 07:58:08,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:58:08,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:58:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:58:08,007 INFO L87 Difference]: Start difference. First operand 17962 states and 53281 transitions. Second operand 17 states. [2019-12-27 07:58:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:11,157 INFO L93 Difference]: Finished difference Result 26584 states and 77930 transitions. [2019-12-27 07:58:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 07:58:11,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 07:58:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:11,193 INFO L225 Difference]: With dead ends: 26584 [2019-12-27 07:58:11,194 INFO L226 Difference]: Without dead ends: 25710 [2019-12-27 07:58:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 07:58:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25710 states. [2019-12-27 07:58:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25710 to 17904. [2019-12-27 07:58:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17904 states. [2019-12-27 07:58:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17904 states to 17904 states and 53150 transitions. [2019-12-27 07:58:11,497 INFO L78 Accepts]: Start accepts. Automaton has 17904 states and 53150 transitions. Word has length 56 [2019-12-27 07:58:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:11,497 INFO L462 AbstractCegarLoop]: Abstraction has 17904 states and 53150 transitions. [2019-12-27 07:58:11,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:58:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 17904 states and 53150 transitions. [2019-12-27 07:58:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:11,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:11,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:11,516 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash 205768991, now seen corresponding path program 4 times [2019-12-27 07:58:11,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:11,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082153509] [2019-12-27 07:58:11,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:12,181 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 07:58:12,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082153509] [2019-12-27 07:58:12,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:12,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:58:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370522677] [2019-12-27 07:58:12,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:58:12,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:58:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:58:12,186 INFO L87 Difference]: Start difference. First operand 17904 states and 53150 transitions. Second operand 17 states. [2019-12-27 07:58:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:15,975 INFO L93 Difference]: Finished difference Result 26914 states and 78972 transitions. [2019-12-27 07:58:15,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 07:58:15,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 07:58:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:16,013 INFO L225 Difference]: With dead ends: 26914 [2019-12-27 07:58:16,013 INFO L226 Difference]: Without dead ends: 25794 [2019-12-27 07:58:16,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 07:58:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25794 states. [2019-12-27 07:58:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25794 to 17710. [2019-12-27 07:58:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17710 states. [2019-12-27 07:58:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17710 states to 17710 states and 52650 transitions. [2019-12-27 07:58:16,316 INFO L78 Accepts]: Start accepts. Automaton has 17710 states and 52650 transitions. Word has length 56 [2019-12-27 07:58:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:16,316 INFO L462 AbstractCegarLoop]: Abstraction has 17710 states and 52650 transitions. [2019-12-27 07:58:16,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:58:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17710 states and 52650 transitions. [2019-12-27 07:58:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:16,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:16,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:16,335 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1725996211, now seen corresponding path program 5 times [2019-12-27 07:58:16,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:16,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258694448] [2019-12-27 07:58:16,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:16,967 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 07:58:16,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258694448] [2019-12-27 07:58:16,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:16,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 07:58:16,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2759825] [2019-12-27 07:58:16,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 07:58:16,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 07:58:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:58:16,969 INFO L87 Difference]: Start difference. First operand 17710 states and 52650 transitions. Second operand 19 states. [2019-12-27 07:58:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:22,460 INFO L93 Difference]: Finished difference Result 27339 states and 80022 transitions. [2019-12-27 07:58:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 07:58:22,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-27 07:58:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:22,495 INFO L225 Difference]: With dead ends: 27339 [2019-12-27 07:58:22,495 INFO L226 Difference]: Without dead ends: 25991 [2019-12-27 07:58:22,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=578, Invalid=3582, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 07:58:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25991 states. [2019-12-27 07:58:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25991 to 17903. [2019-12-27 07:58:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17903 states. [2019-12-27 07:58:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17903 states to 17903 states and 53116 transitions. [2019-12-27 07:58:22,803 INFO L78 Accepts]: Start accepts. Automaton has 17903 states and 53116 transitions. Word has length 56 [2019-12-27 07:58:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:22,803 INFO L462 AbstractCegarLoop]: Abstraction has 17903 states and 53116 transitions. [2019-12-27 07:58:22,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 07:58:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17903 states and 53116 transitions. [2019-12-27 07:58:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:22,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:22,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:22,823 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash -336346481, now seen corresponding path program 6 times [2019-12-27 07:58:22,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:22,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741277076] [2019-12-27 07:58:22,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:23,527 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 07:58:23,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741277076] [2019-12-27 07:58:23,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:23,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:58:23,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096736381] [2019-12-27 07:58:23,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:58:23,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:58:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:58:23,531 INFO L87 Difference]: Start difference. First operand 17903 states and 53116 transitions. Second operand 18 states. [2019-12-27 07:58:29,141 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-27 07:58:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:29,292 INFO L93 Difference]: Finished difference Result 33195 states and 98041 transitions. [2019-12-27 07:58:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 07:58:29,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 07:58:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:29,335 INFO L225 Difference]: With dead ends: 33195 [2019-12-27 07:58:29,335 INFO L226 Difference]: Without dead ends: 32561 [2019-12-27 07:58:29,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=639, Invalid=3917, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 07:58:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32561 states. [2019-12-27 07:58:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32561 to 19593. [2019-12-27 07:58:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19593 states. [2019-12-27 07:58:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19593 states to 19593 states and 57958 transitions. [2019-12-27 07:58:29,688 INFO L78 Accepts]: Start accepts. Automaton has 19593 states and 57958 transitions. Word has length 56 [2019-12-27 07:58:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:29,688 INFO L462 AbstractCegarLoop]: Abstraction has 19593 states and 57958 transitions. [2019-12-27 07:58:29,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:58:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19593 states and 57958 transitions. [2019-12-27 07:58:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:29,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:29,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:29,710 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash -739724749, now seen corresponding path program 7 times [2019-12-27 07:58:29,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:29,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948692432] [2019-12-27 07:58:29,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:30,459 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 07:58:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948692432] [2019-12-27 07:58:30,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:30,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:58:30,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584101589] [2019-12-27 07:58:30,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:58:30,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:58:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:58:30,463 INFO L87 Difference]: Start difference. First operand 19593 states and 57958 transitions. Second operand 18 states. [2019-12-27 07:58:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:34,754 INFO L93 Difference]: Finished difference Result 32877 states and 96668 transitions. [2019-12-27 07:58:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:58:34,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 07:58:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:34,798 INFO L225 Difference]: With dead ends: 32877 [2019-12-27 07:58:34,798 INFO L226 Difference]: Without dead ends: 29031 [2019-12-27 07:58:34,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=474, Invalid=2388, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 07:58:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29031 states. [2019-12-27 07:58:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29031 to 17481. [2019-12-27 07:58:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17481 states. [2019-12-27 07:58:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17481 states to 17481 states and 52081 transitions. [2019-12-27 07:58:35,454 INFO L78 Accepts]: Start accepts. Automaton has 17481 states and 52081 transitions. Word has length 56 [2019-12-27 07:58:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:35,454 INFO L462 AbstractCegarLoop]: Abstraction has 17481 states and 52081 transitions. [2019-12-27 07:58:35,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:58:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 17481 states and 52081 transitions. [2019-12-27 07:58:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:35,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:35,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:35,473 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2103242725, now seen corresponding path program 8 times [2019-12-27 07:58:35,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:35,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554617431] [2019-12-27 07:58:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:35,769 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 07:58:35,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554617431] [2019-12-27 07:58:35,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:35,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:58:35,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601831131] [2019-12-27 07:58:35,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:58:35,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:58:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:58:35,771 INFO L87 Difference]: Start difference. First operand 17481 states and 52081 transitions. Second operand 14 states. [2019-12-27 07:58:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:37,515 INFO L93 Difference]: Finished difference Result 23354 states and 69249 transitions. [2019-12-27 07:58:37,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:58:37,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 07:58:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:37,544 INFO L225 Difference]: With dead ends: 23354 [2019-12-27 07:58:37,544 INFO L226 Difference]: Without dead ends: 20894 [2019-12-27 07:58:37,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:58:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20894 states. [2019-12-27 07:58:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20894 to 17235. [2019-12-27 07:58:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17235 states. [2019-12-27 07:58:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17235 states to 17235 states and 51358 transitions. [2019-12-27 07:58:37,829 INFO L78 Accepts]: Start accepts. Automaton has 17235 states and 51358 transitions. Word has length 56 [2019-12-27 07:58:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:37,829 INFO L462 AbstractCegarLoop]: Abstraction has 17235 states and 51358 transitions. [2019-12-27 07:58:37,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 07:58:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17235 states and 51358 transitions. [2019-12-27 07:58:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:37,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:37,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:37,851 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash -20399805, now seen corresponding path program 9 times [2019-12-27 07:58:37,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:37,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893109098] [2019-12-27 07:58:37,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:38,612 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 07:58:38,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893109098] [2019-12-27 07:58:38,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:38,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 07:58:38,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764684243] [2019-12-27 07:58:38,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 07:58:38,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 07:58:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:58:38,615 INFO L87 Difference]: Start difference. First operand 17235 states and 51358 transitions. Second operand 21 states. [2019-12-27 07:58:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:45,026 INFO L93 Difference]: Finished difference Result 25113 states and 73921 transitions. [2019-12-27 07:58:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 07:58:45,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-12-27 07:58:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:45,058 INFO L225 Difference]: With dead ends: 25113 [2019-12-27 07:58:45,059 INFO L226 Difference]: Without dead ends: 24019 [2019-12-27 07:58:45,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=3105, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 07:58:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24019 states. [2019-12-27 07:58:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24019 to 17427. [2019-12-27 07:58:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-27 07:58:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 51833 transitions. [2019-12-27 07:58:45,345 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 51833 transitions. Word has length 56 [2019-12-27 07:58:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:45,346 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 51833 transitions. [2019-12-27 07:58:45,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 07:58:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 51833 transitions. [2019-12-27 07:58:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:45,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:45,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:45,365 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -786190471, now seen corresponding path program 10 times [2019-12-27 07:58:45,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:45,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388254415] [2019-12-27 07:58:45,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:45,645 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 07:58:45,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388254415] [2019-12-27 07:58:45,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:45,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:58:45,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564576903] [2019-12-27 07:58:45,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:58:45,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:58:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:58:45,646 INFO L87 Difference]: Start difference. First operand 17427 states and 51833 transitions. Second operand 12 states. [2019-12-27 07:58:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:47,139 INFO L93 Difference]: Finished difference Result 29753 states and 89056 transitions. [2019-12-27 07:58:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 07:58:47,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:58:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:47,198 INFO L225 Difference]: With dead ends: 29753 [2019-12-27 07:58:47,198 INFO L226 Difference]: Without dead ends: 29187 [2019-12-27 07:58:47,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:58:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29187 states. [2019-12-27 07:58:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29187 to 19413. [2019-12-27 07:58:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-27 07:58:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 57763 transitions. [2019-12-27 07:58:47,597 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 57763 transitions. Word has length 56 [2019-12-27 07:58:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:47,597 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 57763 transitions. [2019-12-27 07:58:47,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:58:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 57763 transitions. [2019-12-27 07:58:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:47,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:47,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:47,619 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1189568739, now seen corresponding path program 11 times [2019-12-27 07:58:47,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:47,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033429334] [2019-12-27 07:58:47,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:47,873 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 07:58:47,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033429334] [2019-12-27 07:58:47,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:47,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:58:47,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615510591] [2019-12-27 07:58:47,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:58:47,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:58:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:58:47,875 INFO L87 Difference]: Start difference. First operand 19413 states and 57763 transitions. Second operand 12 states. [2019-12-27 07:58:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:49,084 INFO L93 Difference]: Finished difference Result 29567 states and 88097 transitions. [2019-12-27 07:58:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:58:49,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:58:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:49,118 INFO L225 Difference]: With dead ends: 29567 [2019-12-27 07:58:49,118 INFO L226 Difference]: Without dead ends: 24573 [2019-12-27 07:58:49,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:58:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24573 states. [2019-12-27 07:58:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24573 to 15843. [2019-12-27 07:58:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15843 states. [2019-12-27 07:58:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15843 states to 15843 states and 47654 transitions. [2019-12-27 07:58:49,640 INFO L78 Accepts]: Start accepts. Automaton has 15843 states and 47654 transitions. Word has length 56 [2019-12-27 07:58:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:49,640 INFO L462 AbstractCegarLoop]: Abstraction has 15843 states and 47654 transitions. [2019-12-27 07:58:49,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:58:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15843 states and 47654 transitions. [2019-12-27 07:58:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:58:49,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:49,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:49,657 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 12 times [2019-12-27 07:58:49,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:49,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746175625] [2019-12-27 07:58:49,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:58:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:58:49,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:58:49,797 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:58:49,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2354~0.base_19| 4)) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_19|)) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_19| 1) |v_#valid_51|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2354~0.base_19|) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2354~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2354~0.base_19|) |v_ULTIMATE.start_main_~#t2354~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_15|) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_15|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_16|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_21|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2355~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:58:49,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-27 07:58:49,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-27 07:58:49,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1145949491| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1145949491) (= ~x$w_buff1_used~0_Out-1145949491 ~x$w_buff0_used~0_In-1145949491) (= 0 (mod ~x$w_buff1_used~0_Out-1145949491 256)) (= |P1Thread1of1ForFork0_#in~arg.base_In-1145949491| P1Thread1of1ForFork0_~arg.base_Out-1145949491) (= P1Thread1of1ForFork0_~arg.offset_Out-1145949491 |P1Thread1of1ForFork0_#in~arg.offset_In-1145949491|) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1145949491|) (= ~x$w_buff0~0_Out-1145949491 1) (= 1 ~x$w_buff0_used~0_Out-1145949491) (= ~x$w_buff0~0_In-1145949491 ~x$w_buff1~0_Out-1145949491)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1145949491, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1145949491|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1145949491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1145949491} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1145949491, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1145949491, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1145949491, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1145949491, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1145949491|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1145949491|, ~x$w_buff1~0=~x$w_buff1~0_Out-1145949491, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1145949491|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1145949491, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1145949491} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:58:49,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1469600672 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1469600672 256) 0))) (or (and (= ~x$w_buff1~0_In-1469600672 |P2Thread1of1ForFork1_#t~ite32_Out-1469600672|) (not .cse0) (not .cse1)) (and (= ~x~0_In-1469600672 |P2Thread1of1ForFork1_#t~ite32_Out-1469600672|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1469600672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1469600672, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1469600672, ~x~0=~x~0_In-1469600672} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1469600672|, ~x$w_buff1~0=~x$w_buff1~0_In-1469600672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1469600672, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1469600672, ~x~0=~x~0_In-1469600672} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:58:49,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:58:49,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-21520681 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-21520681 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-21520681|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-21520681 |P2Thread1of1ForFork1_#t~ite34_Out-21520681|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-21520681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-21520681} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-21520681|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-21520681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-21520681} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:58:49,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2014518442 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2014518442 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out2014518442| ~x$w_buff0_used~0_In2014518442) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out2014518442| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2014518442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2014518442, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2014518442|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:58:49,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-203709793 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-203709793 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-203709793 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-203709793 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-203709793| ~x$w_buff1_used~0_In-203709793)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-203709793| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-203709793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-203709793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-203709793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-203709793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-203709793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-203709793, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-203709793|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:58:49,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1041442639 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1041442639 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1041442639) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1041442639 ~x$r_buff0_thd2~0_Out1041442639)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1041442639, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041442639} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1041442639|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1041442639, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041442639} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:58:49,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1623660737 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1623660737 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1623660737 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1623660737 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1623660737| ~x$r_buff1_thd2~0_In1623660737)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1623660737| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1623660737, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1623660737, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1623660737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1623660737} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1623660737|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1623660737, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1623660737, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1623660737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1623660737} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:58:49,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:58:49,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1259087123 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1259087123| |P0Thread1of1ForFork2_#t~ite11_Out-1259087123|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1259087123 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1259087123 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1259087123 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1259087123 256)) .cse0))) .cse1 (= ~x$w_buff1~0_In-1259087123 |P0Thread1of1ForFork2_#t~ite11_Out-1259087123|)) (and (= ~x$w_buff1~0_In-1259087123 |P0Thread1of1ForFork2_#t~ite12_Out-1259087123|) (= |P0Thread1of1ForFork2_#t~ite11_In-1259087123| |P0Thread1of1ForFork2_#t~ite11_Out-1259087123|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1259087123, ~x$w_buff1~0=~x$w_buff1~0_In-1259087123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1259087123, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1259087123, ~weak$$choice2~0=~weak$$choice2~0_In-1259087123, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1259087123|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1259087123, ~x$w_buff1~0=~x$w_buff1~0_In-1259087123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1259087123, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1259087123, ~weak$$choice2~0=~weak$$choice2~0_In-1259087123, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1259087123|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1259087123|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:58:49,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1936516216 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-1936516216| |P0Thread1of1ForFork2_#t~ite14_Out-1936516216|) (= ~x$w_buff0_used~0_In-1936516216 |P0Thread1of1ForFork2_#t~ite15_Out-1936516216|)) (and (= ~x$w_buff0_used~0_In-1936516216 |P0Thread1of1ForFork2_#t~ite14_Out-1936516216|) (= |P0Thread1of1ForFork2_#t~ite15_Out-1936516216| |P0Thread1of1ForFork2_#t~ite14_Out-1936516216|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1936516216 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1936516216 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1936516216 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1936516216 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1936516216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936516216, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1936516216, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1936516216|, ~weak$$choice2~0=~weak$$choice2~0_In-1936516216, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936516216} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1936516216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936516216, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1936516216|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1936516216, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1936516216|, ~weak$$choice2~0=~weak$$choice2~0_In-1936516216, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936516216} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:58:49,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse5 (= |P0Thread1of1ForFork2_#t~ite17_Out-545353124| |P0Thread1of1ForFork2_#t~ite18_Out-545353124|)) (.cse0 (= (mod ~x$w_buff1_used~0_In-545353124 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In-545353124 256))) (.cse4 (= (mod ~x$r_buff1_thd1~0_In-545353124 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-545353124 256))) (.cse3 (= (mod ~weak$$choice2~0_In-545353124 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (= |P0Thread1of1ForFork2_#t~ite16_Out-545353124| 0) (= |P0Thread1of1ForFork2_#t~ite16_Out-545353124| |P0Thread1of1ForFork2_#t~ite17_Out-545353124|) .cse3 (or (not .cse4) .cse1) .cse5)) (and (or (and .cse3 (= ~x$w_buff1_used~0_In-545353124 |P0Thread1of1ForFork2_#t~ite17_Out-545353124|) .cse5 (or (and .cse6 .cse0) (and .cse6 .cse4) .cse2)) (and (= |P0Thread1of1ForFork2_#t~ite17_In-545353124| |P0Thread1of1ForFork2_#t~ite17_Out-545353124|) (not .cse3) (= ~x$w_buff1_used~0_In-545353124 |P0Thread1of1ForFork2_#t~ite18_Out-545353124|))) (= |P0Thread1of1ForFork2_#t~ite16_In-545353124| |P0Thread1of1ForFork2_#t~ite16_Out-545353124|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-545353124, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-545353124|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-545353124, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-545353124|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-545353124, ~weak$$choice2~0=~weak$$choice2~0_In-545353124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-545353124} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-545353124, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-545353124|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-545353124|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-545353124, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-545353124|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-545353124, ~weak$$choice2~0=~weak$$choice2~0_In-545353124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-545353124} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:58:49,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 07:58:49,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse2 (= |P0Thread1of1ForFork2_#t~ite23_Out-373152980| |P0Thread1of1ForFork2_#t~ite24_Out-373152980|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-373152980 256))) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In-373152980 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In-373152980 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-373152980 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-373152980 256)))) (or (let ((.cse4 (not .cse6))) (and .cse0 (not .cse1) (= |P0Thread1of1ForFork2_#t~ite22_Out-373152980| |P0Thread1of1ForFork2_#t~ite23_Out-373152980|) .cse2 (= |P0Thread1of1ForFork2_#t~ite22_Out-373152980| 0) (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and .cse0 .cse2 (= ~x$r_buff1_thd1~0_In-373152980 |P0Thread1of1ForFork2_#t~ite23_Out-373152980|) (or .cse1 (and .cse5 .cse6) (and .cse6 .cse3))) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-373152980| |P0Thread1of1ForFork2_#t~ite23_In-373152980|) (= ~x$r_buff1_thd1~0_In-373152980 |P0Thread1of1ForFork2_#t~ite24_Out-373152980|) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite22_In-373152980| |P0Thread1of1ForFork2_#t~ite22_Out-373152980|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-373152980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-373152980, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-373152980, ~weak$$choice2~0=~weak$$choice2~0_In-373152980, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-373152980|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-373152980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-373152980} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-373152980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-373152980, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-373152980, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-373152980|, ~weak$$choice2~0=~weak$$choice2~0_In-373152980, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-373152980|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-373152980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-373152980} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:58:49,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:58:49,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1913502283 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1913502283 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1913502283 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1913502283 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out1913502283| ~x$w_buff1_used~0_In1913502283) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1913502283| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1913502283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1913502283, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1913502283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913502283} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1913502283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1913502283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1913502283, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1913502283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913502283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:58:49,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2016720112 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2016720112 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In2016720112 |P2Thread1of1ForFork1_#t~ite36_Out2016720112|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out2016720112|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2016720112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016720112} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out2016720112|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2016720112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016720112} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:58:49,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-554461222 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-554461222 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-554461222 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-554461222 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-554461222| ~x$r_buff1_thd3~0_In-554461222) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out-554461222| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-554461222, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-554461222, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-554461222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-554461222|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-554461222, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-554461222, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-554461222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:58:49,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 07:58:49,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:58:49,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1351844687 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1351844687 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1351844687| ~x~0_In1351844687) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In1351844687 |ULTIMATE.start_main_#t~ite41_Out1351844687|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1351844687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1351844687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1351844687, ~x~0=~x~0_In1351844687} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1351844687|, ~x$w_buff1~0=~x$w_buff1~0_In1351844687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1351844687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1351844687, ~x~0=~x~0_In1351844687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:58:49,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:58:49,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1709174072 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1709174072 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1709174072|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1709174072 |ULTIMATE.start_main_#t~ite43_Out-1709174072|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1709174072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1709174072} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1709174072, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1709174072|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1709174072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:58:49,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In295671273 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In295671273 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In295671273 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In295671273 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out295671273| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out295671273| ~x$w_buff1_used~0_In295671273) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In295671273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In295671273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In295671273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In295671273, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out295671273|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:58:49,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-91083015 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-91083015 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-91083015| 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-91083015 |ULTIMATE.start_main_#t~ite45_Out-91083015|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-91083015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91083015} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-91083015, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-91083015|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91083015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:58:49,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1815328726 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1815328726 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1815328726 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1815328726 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1815328726|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1815328726| ~x$r_buff1_thd0~0_In-1815328726) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1815328726, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1815328726, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1815328726, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815328726} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1815328726, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1815328726|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1815328726, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1815328726, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815328726} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:58:49,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:58:49,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:58:49 BasicIcfg [2019-12-27 07:58:49,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:58:49,930 INFO L168 Benchmark]: Toolchain (without parser) took 118592.42 ms. Allocated memory was 138.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,930 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.36 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.9 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,935 INFO L168 Benchmark]: Boogie Preprocessor took 40.92 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,935 INFO L168 Benchmark]: RCFGBuilder took 818.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,936 INFO L168 Benchmark]: TraceAbstraction took 116776.28 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:58:49,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.36 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.9 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.92 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.98 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 116776.28 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2354, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2355, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2356, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 116.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 58.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6344 SDtfs, 10350 SDslu, 30392 SDs, 0 SdLazy, 36717 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7116 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 175150 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1347 NumberOfCodeBlocks, 1347 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 442358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...