/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:17:37,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:17:37,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:17:37,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:17:37,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:17:37,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:17:37,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:17:37,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:17:37,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:17:37,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:17:37,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:17:37,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:17:37,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:17:37,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:17:37,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:17:37,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:17:37,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:17:37,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:17:37,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:17:37,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:17:37,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:17:37,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:17:37,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:17:37,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:17:37,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:17:37,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:17:37,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:17:37,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:17:37,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:17:37,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:17:37,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:17:37,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:17:37,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:17:37,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:17:37,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:17:37,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:17:37,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:17:37,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:17:37,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:17:37,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:17:37,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:17:37,331 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-SemanticLbe.epf [2019-12-27 02:17:37,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:17:37,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:17:37,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:17:37,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:17:37,367 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:17:37,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:17:37,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:17:37,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:17:37,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:17:37,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:17:37,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:17:37,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:17:37,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:17:37,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:17:37,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:17:37,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:17:37,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:17:37,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:17:37,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:17:37,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:17:37,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:17:37,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:17:37,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:17:37,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:17:37,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:17:37,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:17:37,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:17:37,665 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:17:37,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 02:17:37,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a8939f5/e246dbc8b09d47a1a783a1d6dbc93288/FLAG01e7c0a79 [2019-12-27 02:17:38,263 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:17:38,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 02:17:38,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a8939f5/e246dbc8b09d47a1a783a1d6dbc93288/FLAG01e7c0a79 [2019-12-27 02:17:38,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a8939f5/e246dbc8b09d47a1a783a1d6dbc93288 [2019-12-27 02:17:38,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:17:38,523 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:17:38,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:17:38,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:17:38,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:17:38,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:17:38" (1/1) ... [2019-12-27 02:17:38,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c42c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:38, skipping insertion in model container [2019-12-27 02:17:38,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:17:38" (1/1) ... [2019-12-27 02:17:38,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:17:38,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:17:39,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:17:39,081 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:17:39,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:17:39,257 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:17:39,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39 WrapperNode [2019-12-27 02:17:39,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:17:39,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:17:39,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:17:39,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:17:39,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:17:39,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:17:39,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:17:39,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:17:39,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (1/1) ... [2019-12-27 02:17:39,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:17:39,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:17:39,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:17:39,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:17:39,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (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 02:17:39,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:17:39,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:17:39,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:17:39,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:17:39,445 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:17:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:17:39,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:17:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:17:39,446 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:17:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:17:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:17:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:17:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:17:39,448 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 02:17:40,231 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:17:40,231 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:17:40,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:17:40 BoogieIcfgContainer [2019-12-27 02:17:40,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:17:40,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:17:40,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:17:40,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:17:40,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:17:38" (1/3) ... [2019-12-27 02:17:40,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2c69b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:17:40, skipping insertion in model container [2019-12-27 02:17:40,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:39" (2/3) ... [2019-12-27 02:17:40,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2c69b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:17:40, skipping insertion in model container [2019-12-27 02:17:40,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:17:40" (3/3) ... [2019-12-27 02:17:40,242 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2019-12-27 02:17:40,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:17:40,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:17:40,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:17:40,263 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:17:40,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,320 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,321 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:40,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:17:40,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:17:40,425 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:17:40,425 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:17:40,425 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:17:40,425 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:17:40,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:17:40,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:17:40,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:17:40,442 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 02:17:40,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 02:17:40,566 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 02:17:40,567 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:17:40,579 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:17:40,600 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 02:17:40,652 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 02:17:40,653 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:17:40,660 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:17:40,679 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 02:17:40,680 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:17:45,949 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:17:46,085 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:17:46,112 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82137 [2019-12-27 02:17:46,113 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 02:17:46,117 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 02:18:01,059 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102312 states. [2019-12-27 02:18:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 102312 states. [2019-12-27 02:18:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:18:01,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:01,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:18:01,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash 830375313, now seen corresponding path program 1 times [2019-12-27 02:18:01,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:01,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176024627] [2019-12-27 02:18:01,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:01,366 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 02:18:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176024627] [2019-12-27 02:18:01,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:01,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:18:01,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020272597] [2019-12-27 02:18:01,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:01,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:01,398 INFO L87 Difference]: Start difference. First operand 102312 states. Second operand 3 states. [2019-12-27 02:18:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:03,088 INFO L93 Difference]: Finished difference Result 102012 states and 430324 transitions. [2019-12-27 02:18:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:03,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:18:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:03,825 INFO L225 Difference]: With dead ends: 102012 [2019-12-27 02:18:03,825 INFO L226 Difference]: Without dead ends: 99828 [2019-12-27 02:18:03,826 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 02:18:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99828 states. [2019-12-27 02:18:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99828 to 99828. [2019-12-27 02:18:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99828 states. [2019-12-27 02:18:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99828 states to 99828 states and 421406 transitions. [2019-12-27 02:18:15,579 INFO L78 Accepts]: Start accepts. Automaton has 99828 states and 421406 transitions. Word has length 5 [2019-12-27 02:18:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:15,579 INFO L462 AbstractCegarLoop]: Abstraction has 99828 states and 421406 transitions. [2019-12-27 02:18:15,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 99828 states and 421406 transitions. [2019-12-27 02:18:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:18:15,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:15,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:15,585 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1614971329, now seen corresponding path program 1 times [2019-12-27 02:18:15,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:15,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42018280] [2019-12-27 02:18:15,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:15,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42018280] [2019-12-27 02:18:15,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:15,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:15,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933646720] [2019-12-27 02:18:15,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:15,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:15,729 INFO L87 Difference]: Start difference. First operand 99828 states and 421406 transitions. Second operand 4 states. [2019-12-27 02:18:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:20,841 INFO L93 Difference]: Finished difference Result 160374 states and 648740 transitions. [2019-12-27 02:18:20,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:20,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:18:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:21,492 INFO L225 Difference]: With dead ends: 160374 [2019-12-27 02:18:21,493 INFO L226 Difference]: Without dead ends: 160325 [2019-12-27 02:18:21,494 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 02:18:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160325 states. [2019-12-27 02:18:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160325 to 147565. [2019-12-27 02:18:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147565 states. [2019-12-27 02:18:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147565 states to 147565 states and 602627 transitions. [2019-12-27 02:18:30,471 INFO L78 Accepts]: Start accepts. Automaton has 147565 states and 602627 transitions. Word has length 11 [2019-12-27 02:18:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 147565 states and 602627 transitions. [2019-12-27 02:18:30,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 147565 states and 602627 transitions. [2019-12-27 02:18:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:18:30,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:30,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:30,478 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1756735114, now seen corresponding path program 1 times [2019-12-27 02:18:30,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:30,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043647019] [2019-12-27 02:18:30,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:30,538 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 02:18:30,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043647019] [2019-12-27 02:18:30,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:30,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:30,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985014892] [2019-12-27 02:18:30,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:30,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:30,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:30,540 INFO L87 Difference]: Start difference. First operand 147565 states and 602627 transitions. Second operand 3 states. [2019-12-27 02:18:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:30,656 INFO L93 Difference]: Finished difference Result 30660 states and 98018 transitions. [2019-12-27 02:18:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:30,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:18:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:30,701 INFO L225 Difference]: With dead ends: 30660 [2019-12-27 02:18:30,701 INFO L226 Difference]: Without dead ends: 30660 [2019-12-27 02:18:30,702 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 02:18:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30660 states. [2019-12-27 02:18:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30660 to 30660. [2019-12-27 02:18:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30660 states. [2019-12-27 02:18:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30660 states to 30660 states and 98018 transitions. [2019-12-27 02:18:35,924 INFO L78 Accepts]: Start accepts. Automaton has 30660 states and 98018 transitions. Word has length 13 [2019-12-27 02:18:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:35,924 INFO L462 AbstractCegarLoop]: Abstraction has 30660 states and 98018 transitions. [2019-12-27 02:18:35,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30660 states and 98018 transitions. [2019-12-27 02:18:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:18:35,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:35,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:35,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -781051858, now seen corresponding path program 1 times [2019-12-27 02:18:35,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:35,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712457270] [2019-12-27 02:18:35,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:36,080 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 02:18:36,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712457270] [2019-12-27 02:18:36,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:36,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:36,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774378629] [2019-12-27 02:18:36,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:36,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:36,084 INFO L87 Difference]: Start difference. First operand 30660 states and 98018 transitions. Second operand 4 states. [2019-12-27 02:18:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:36,492 INFO L93 Difference]: Finished difference Result 41073 states and 128391 transitions. [2019-12-27 02:18:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:36,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:18:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:36,550 INFO L225 Difference]: With dead ends: 41073 [2019-12-27 02:18:36,551 INFO L226 Difference]: Without dead ends: 41066 [2019-12-27 02:18:36,551 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 02:18:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41066 states. [2019-12-27 02:18:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41066 to 36091. [2019-12-27 02:18:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36091 states. [2019-12-27 02:18:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36091 states to 36091 states and 114542 transitions. [2019-12-27 02:18:37,179 INFO L78 Accepts]: Start accepts. Automaton has 36091 states and 114542 transitions. Word has length 13 [2019-12-27 02:18:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:37,179 INFO L462 AbstractCegarLoop]: Abstraction has 36091 states and 114542 transitions. [2019-12-27 02:18:37,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36091 states and 114542 transitions. [2019-12-27 02:18:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:18:37,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:37,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:37,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1241691420, now seen corresponding path program 1 times [2019-12-27 02:18:37,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:37,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485472234] [2019-12-27 02:18:37,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:37,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 02:18:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485472234] [2019-12-27 02:18:37,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:37,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:37,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184550307] [2019-12-27 02:18:37,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:37,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:37,288 INFO L87 Difference]: Start difference. First operand 36091 states and 114542 transitions. Second operand 5 states. [2019-12-27 02:18:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:38,278 INFO L93 Difference]: Finished difference Result 48600 states and 151172 transitions. [2019-12-27 02:18:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:18:38,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 02:18:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:38,343 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 02:18:38,343 INFO L226 Difference]: Without dead ends: 48587 [2019-12-27 02:18:38,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48587 states. [2019-12-27 02:18:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48587 to 36434. [2019-12-27 02:18:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36434 states. [2019-12-27 02:18:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36434 states to 36434 states and 115508 transitions. [2019-12-27 02:18:39,049 INFO L78 Accepts]: Start accepts. Automaton has 36434 states and 115508 transitions. Word has length 19 [2019-12-27 02:18:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:39,049 INFO L462 AbstractCegarLoop]: Abstraction has 36434 states and 115508 transitions. [2019-12-27 02:18:39,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 36434 states and 115508 transitions. [2019-12-27 02:18:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:18:39,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:39,063 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 02:18:39,064 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1959079235, now seen corresponding path program 1 times [2019-12-27 02:18:39,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:39,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307731107] [2019-12-27 02:18:39,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:39,129 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 02:18:39,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307731107] [2019-12-27 02:18:39,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:39,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:39,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814581051] [2019-12-27 02:18:39,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:39,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:39,131 INFO L87 Difference]: Start difference. First operand 36434 states and 115508 transitions. Second operand 4 states. [2019-12-27 02:18:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:39,170 INFO L93 Difference]: Finished difference Result 7041 states and 19099 transitions. [2019-12-27 02:18:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:18:39,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:18:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:39,181 INFO L225 Difference]: With dead ends: 7041 [2019-12-27 02:18:39,181 INFO L226 Difference]: Without dead ends: 7041 [2019-12-27 02:18:39,182 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 02:18:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-12-27 02:18:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6929. [2019-12-27 02:18:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6929 states. [2019-12-27 02:18:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 18779 transitions. [2019-12-27 02:18:39,289 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 18779 transitions. Word has length 25 [2019-12-27 02:18:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:39,290 INFO L462 AbstractCegarLoop]: Abstraction has 6929 states and 18779 transitions. [2019-12-27 02:18:39,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 18779 transitions. [2019-12-27 02:18:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:18:39,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:39,301 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] [2019-12-27 02:18:39,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:39,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1376683013, now seen corresponding path program 1 times [2019-12-27 02:18:39,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:39,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429723261] [2019-12-27 02:18:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:39,373 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 02:18:39,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429723261] [2019-12-27 02:18:39,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:39,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:18:39,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413315600] [2019-12-27 02:18:39,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:39,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:39,375 INFO L87 Difference]: Start difference. First operand 6929 states and 18779 transitions. Second operand 5 states. [2019-12-27 02:18:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:39,410 INFO L93 Difference]: Finished difference Result 5022 states and 14415 transitions. [2019-12-27 02:18:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:39,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 02:18:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:39,418 INFO L225 Difference]: With dead ends: 5022 [2019-12-27 02:18:39,419 INFO L226 Difference]: Without dead ends: 5022 [2019-12-27 02:18:39,419 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 02:18:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-12-27 02:18:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4658. [2019-12-27 02:18:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-12-27 02:18:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 13431 transitions. [2019-12-27 02:18:39,515 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 13431 transitions. Word has length 37 [2019-12-27 02:18:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:39,515 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 13431 transitions. [2019-12-27 02:18:39,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 13431 transitions. [2019-12-27 02:18:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:39,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:39,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:39,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash 863082331, now seen corresponding path program 1 times [2019-12-27 02:18:39,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:39,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375422553] [2019-12-27 02:18:39,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:39,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375422553] [2019-12-27 02:18:39,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:39,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:18:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312996181] [2019-12-27 02:18:39,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:18:39,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:18:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:18:39,696 INFO L87 Difference]: Start difference. First operand 4658 states and 13431 transitions. Second operand 6 states. [2019-12-27 02:18:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:40,231 INFO L93 Difference]: Finished difference Result 8140 states and 23090 transitions. [2019-12-27 02:18:40,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:18:40,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 02:18:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:40,243 INFO L225 Difference]: With dead ends: 8140 [2019-12-27 02:18:40,243 INFO L226 Difference]: Without dead ends: 8140 [2019-12-27 02:18:40,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 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 02:18:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8140 states. [2019-12-27 02:18:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8140 to 6258. [2019-12-27 02:18:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6258 states. [2019-12-27 02:18:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 18053 transitions. [2019-12-27 02:18:40,400 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 18053 transitions. Word has length 65 [2019-12-27 02:18:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:40,401 INFO L462 AbstractCegarLoop]: Abstraction has 6258 states and 18053 transitions. [2019-12-27 02:18:40,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:18:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 18053 transitions. [2019-12-27 02:18:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:40,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:40,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:40,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:40,411 INFO L82 PathProgramCache]: Analyzing trace with hash 3102675, now seen corresponding path program 2 times [2019-12-27 02:18:40,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:40,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6638027] [2019-12-27 02:18:40,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:40,542 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 02:18:40,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6638027] [2019-12-27 02:18:40,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:40,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:18:40,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083654715] [2019-12-27 02:18:40,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:18:40,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:18:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:40,547 INFO L87 Difference]: Start difference. First operand 6258 states and 18053 transitions. Second operand 7 states. [2019-12-27 02:18:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:41,448 INFO L93 Difference]: Finished difference Result 10852 states and 31037 transitions. [2019-12-27 02:18:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:18:41,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:18:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:41,463 INFO L225 Difference]: With dead ends: 10852 [2019-12-27 02:18:41,464 INFO L226 Difference]: Without dead ends: 10852 [2019-12-27 02:18:41,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:18:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10852 states. [2019-12-27 02:18:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10852 to 6475. [2019-12-27 02:18:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6475 states. [2019-12-27 02:18:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6475 states to 6475 states and 18722 transitions. [2019-12-27 02:18:41,597 INFO L78 Accepts]: Start accepts. Automaton has 6475 states and 18722 transitions. Word has length 65 [2019-12-27 02:18:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:41,597 INFO L462 AbstractCegarLoop]: Abstraction has 6475 states and 18722 transitions. [2019-12-27 02:18:41,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:18:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6475 states and 18722 transitions. [2019-12-27 02:18:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:41,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:41,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:41,607 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2003534521, now seen corresponding path program 3 times [2019-12-27 02:18:41,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:41,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001616954] [2019-12-27 02:18:41,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:41,727 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 02:18:41,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001616954] [2019-12-27 02:18:41,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:41,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:18:41,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933386263] [2019-12-27 02:18:41,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:18:41,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:18:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:18:41,730 INFO L87 Difference]: Start difference. First operand 6475 states and 18722 transitions. Second operand 6 states. [2019-12-27 02:18:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:42,173 INFO L93 Difference]: Finished difference Result 11030 states and 31685 transitions. [2019-12-27 02:18:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:18:42,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 02:18:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:42,188 INFO L225 Difference]: With dead ends: 11030 [2019-12-27 02:18:42,188 INFO L226 Difference]: Without dead ends: 11030 [2019-12-27 02:18:42,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11030 states. [2019-12-27 02:18:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11030 to 7212. [2019-12-27 02:18:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7212 states. [2019-12-27 02:18:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 20959 transitions. [2019-12-27 02:18:42,308 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 20959 transitions. Word has length 65 [2019-12-27 02:18:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:42,309 INFO L462 AbstractCegarLoop]: Abstraction has 7212 states and 20959 transitions. [2019-12-27 02:18:42,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:18:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 20959 transitions. [2019-12-27 02:18:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:42,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:42,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:42,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1470758855, now seen corresponding path program 4 times [2019-12-27 02:18:42,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:42,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815784944] [2019-12-27 02:18:42,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:42,460 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 02:18:42,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815784944] [2019-12-27 02:18:42,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:42,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:42,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873204023] [2019-12-27 02:18:42,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:18:42,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:18:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:18:42,465 INFO L87 Difference]: Start difference. First operand 7212 states and 20959 transitions. Second operand 8 states. [2019-12-27 02:18:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:43,531 INFO L93 Difference]: Finished difference Result 11131 states and 31721 transitions. [2019-12-27 02:18:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:18:43,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:18:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:43,547 INFO L225 Difference]: With dead ends: 11131 [2019-12-27 02:18:43,547 INFO L226 Difference]: Without dead ends: 11131 [2019-12-27 02:18:43,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:18:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11131 states. [2019-12-27 02:18:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11131 to 7709. [2019-12-27 02:18:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7709 states. [2019-12-27 02:18:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7709 states to 7709 states and 22411 transitions. [2019-12-27 02:18:43,681 INFO L78 Accepts]: Start accepts. Automaton has 7709 states and 22411 transitions. Word has length 65 [2019-12-27 02:18:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:43,681 INFO L462 AbstractCegarLoop]: Abstraction has 7709 states and 22411 transitions. [2019-12-27 02:18:43,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:18:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7709 states and 22411 transitions. [2019-12-27 02:18:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:43,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:43,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:43,692 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -297725283, now seen corresponding path program 5 times [2019-12-27 02:18:43,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:43,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952041458] [2019-12-27 02:18:43,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:43,831 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 02:18:43,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952041458] [2019-12-27 02:18:43,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:43,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:43,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568729711] [2019-12-27 02:18:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:18:43,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:18:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:18:43,833 INFO L87 Difference]: Start difference. First operand 7709 states and 22411 transitions. Second operand 8 states. [2019-12-27 02:18:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:44,832 INFO L93 Difference]: Finished difference Result 12481 states and 35760 transitions. [2019-12-27 02:18:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:18:44,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:18:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:44,847 INFO L225 Difference]: With dead ends: 12481 [2019-12-27 02:18:44,847 INFO L226 Difference]: Without dead ends: 12481 [2019-12-27 02:18:44,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:18:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12481 states. [2019-12-27 02:18:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12481 to 7389. [2019-12-27 02:18:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7389 states. [2019-12-27 02:18:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 21517 transitions. [2019-12-27 02:18:44,978 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 21517 transitions. Word has length 65 [2019-12-27 02:18:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:44,978 INFO L462 AbstractCegarLoop]: Abstraction has 7389 states and 21517 transitions. [2019-12-27 02:18:44,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:18:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 21517 transitions. [2019-12-27 02:18:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:44,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:44,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:44,988 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1746055701, now seen corresponding path program 6 times [2019-12-27 02:18:44,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:44,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293971384] [2019-12-27 02:18:44,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:45,192 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 02:18:45,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293971384] [2019-12-27 02:18:45,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:45,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:45,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206493226] [2019-12-27 02:18:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:18:45,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:18:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:45,195 INFO L87 Difference]: Start difference. First operand 7389 states and 21517 transitions. Second operand 9 states. [2019-12-27 02:18:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:46,401 INFO L93 Difference]: Finished difference Result 12419 states and 35593 transitions. [2019-12-27 02:18:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:18:46,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:18:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:46,419 INFO L225 Difference]: With dead ends: 12419 [2019-12-27 02:18:46,419 INFO L226 Difference]: Without dead ends: 12419 [2019-12-27 02:18:46,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:18:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12419 states. [2019-12-27 02:18:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12419 to 7109. [2019-12-27 02:18:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2019-12-27 02:18:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 20683 transitions. [2019-12-27 02:18:46,563 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 20683 transitions. Word has length 65 [2019-12-27 02:18:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:46,563 INFO L462 AbstractCegarLoop]: Abstraction has 7109 states and 20683 transitions. [2019-12-27 02:18:46,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:18:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 20683 transitions. [2019-12-27 02:18:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:46,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:46,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:46,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 661174395, now seen corresponding path program 7 times [2019-12-27 02:18:46,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:46,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592187140] [2019-12-27 02:18:46,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:46,679 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 02:18:46,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592187140] [2019-12-27 02:18:46,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:46,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:18:46,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658423266] [2019-12-27 02:18:46,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:18:46,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:18:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:46,681 INFO L87 Difference]: Start difference. First operand 7109 states and 20683 transitions. Second operand 7 states. [2019-12-27 02:18:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:47,350 INFO L93 Difference]: Finished difference Result 11648 states and 33362 transitions. [2019-12-27 02:18:47,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:18:47,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:18:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:47,372 INFO L225 Difference]: With dead ends: 11648 [2019-12-27 02:18:47,372 INFO L226 Difference]: Without dead ends: 11648 [2019-12-27 02:18:47,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2019-12-27 02:18:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 7193. [2019-12-27 02:18:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7193 states. [2019-12-27 02:18:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7193 states to 7193 states and 20884 transitions. [2019-12-27 02:18:47,648 INFO L78 Accepts]: Start accepts. Automaton has 7193 states and 20884 transitions. Word has length 65 [2019-12-27 02:18:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:47,648 INFO L462 AbstractCegarLoop]: Abstraction has 7193 states and 20884 transitions. [2019-12-27 02:18:47,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:18:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7193 states and 20884 transitions. [2019-12-27 02:18:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:47,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:47,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:47,673 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 83202199, now seen corresponding path program 8 times [2019-12-27 02:18:47,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:47,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105303075] [2019-12-27 02:18:47,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:47,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105303075] [2019-12-27 02:18:47,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:47,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:47,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795952151] [2019-12-27 02:18:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:18:47,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:18:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:18:47,830 INFO L87 Difference]: Start difference. First operand 7193 states and 20884 transitions. Second operand 8 states. [2019-12-27 02:18:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:48,879 INFO L93 Difference]: Finished difference Result 12422 states and 35560 transitions. [2019-12-27 02:18:48,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:18:48,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:18:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:48,896 INFO L225 Difference]: With dead ends: 12422 [2019-12-27 02:18:48,897 INFO L226 Difference]: Without dead ends: 12422 [2019-12-27 02:18:48,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:18:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2019-12-27 02:18:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 6493. [2019-12-27 02:18:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-12-27 02:18:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 18901 transitions. [2019-12-27 02:18:49,135 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 18901 transitions. Word has length 65 [2019-12-27 02:18:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:49,135 INFO L462 AbstractCegarLoop]: Abstraction has 6493 states and 18901 transitions. [2019-12-27 02:18:49,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:18:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 18901 transitions. [2019-12-27 02:18:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:18:49,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:49,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:49,142 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash -633612741, now seen corresponding path program 1 times [2019-12-27 02:18:49,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:49,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551679751] [2019-12-27 02:18:49,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:49,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551679751] [2019-12-27 02:18:49,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:49,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:49,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516631859] [2019-12-27 02:18:49,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:49,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:49,208 INFO L87 Difference]: Start difference. First operand 6493 states and 18901 transitions. Second operand 3 states. [2019-12-27 02:18:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:49,240 INFO L93 Difference]: Finished difference Result 5909 states and 16912 transitions. [2019-12-27 02:18:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:49,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:18:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:49,249 INFO L225 Difference]: With dead ends: 5909 [2019-12-27 02:18:49,250 INFO L226 Difference]: Without dead ends: 5909 [2019-12-27 02:18:49,250 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 02:18:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5909 states. [2019-12-27 02:18:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 5909. [2019-12-27 02:18:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-12-27 02:18:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 16912 transitions. [2019-12-27 02:18:49,378 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 16912 transitions. Word has length 66 [2019-12-27 02:18:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:49,379 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 16912 transitions. [2019-12-27 02:18:49,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 16912 transitions. [2019-12-27 02:18:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:18:49,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:49,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:49,392 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1483185693, now seen corresponding path program 1 times [2019-12-27 02:18:49,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:49,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073657769] [2019-12-27 02:18:49,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:49,660 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 02:18:49,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073657769] [2019-12-27 02:18:49,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:49,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:18:49,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472541424] [2019-12-27 02:18:49,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:18:49,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:18:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:18:49,663 INFO L87 Difference]: Start difference. First operand 5909 states and 16912 transitions. Second operand 10 states. [2019-12-27 02:18:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:51,259 INFO L93 Difference]: Finished difference Result 12207 states and 34961 transitions. [2019-12-27 02:18:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 02:18:51,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:18:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:51,278 INFO L225 Difference]: With dead ends: 12207 [2019-12-27 02:18:51,278 INFO L226 Difference]: Without dead ends: 12207 [2019-12-27 02:18:51,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:18:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2019-12-27 02:18:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 6322. [2019-12-27 02:18:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6322 states. [2019-12-27 02:18:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6322 states to 6322 states and 18171 transitions. [2019-12-27 02:18:51,415 INFO L78 Accepts]: Start accepts. Automaton has 6322 states and 18171 transitions. Word has length 66 [2019-12-27 02:18:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:51,415 INFO L462 AbstractCegarLoop]: Abstraction has 6322 states and 18171 transitions. [2019-12-27 02:18:51,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:18:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6322 states and 18171 transitions. [2019-12-27 02:18:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:18:51,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:51,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:51,422 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1658227639, now seen corresponding path program 2 times [2019-12-27 02:18:51,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:51,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659718836] [2019-12-27 02:18:51,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:51,494 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 02:18:51,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659718836] [2019-12-27 02:18:51,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:51,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:51,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248193692] [2019-12-27 02:18:51,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:51,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:51,496 INFO L87 Difference]: Start difference. First operand 6322 states and 18171 transitions. Second operand 3 states. [2019-12-27 02:18:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:51,554 INFO L93 Difference]: Finished difference Result 6322 states and 18170 transitions. [2019-12-27 02:18:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:51,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:18:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:51,565 INFO L225 Difference]: With dead ends: 6322 [2019-12-27 02:18:51,565 INFO L226 Difference]: Without dead ends: 6322 [2019-12-27 02:18:51,566 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 02:18:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6322 states. [2019-12-27 02:18:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6322 to 3455. [2019-12-27 02:18:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3455 states. [2019-12-27 02:18:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 10097 transitions. [2019-12-27 02:18:51,667 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 10097 transitions. Word has length 66 [2019-12-27 02:18:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:51,667 INFO L462 AbstractCegarLoop]: Abstraction has 3455 states and 10097 transitions. [2019-12-27 02:18:51,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 10097 transitions. [2019-12-27 02:18:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:51,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:51,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:51,674 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 486113497, now seen corresponding path program 1 times [2019-12-27 02:18:51,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313574098] [2019-12-27 02:18:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:51,760 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 02:18:51,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313574098] [2019-12-27 02:18:51,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:51,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:51,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217022545] [2019-12-27 02:18:51,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:51,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:51,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:51,762 INFO L87 Difference]: Start difference. First operand 3455 states and 10097 transitions. Second operand 3 states. [2019-12-27 02:18:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:51,790 INFO L93 Difference]: Finished difference Result 3375 states and 9573 transitions. [2019-12-27 02:18:51,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:51,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 02:18:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:51,798 INFO L225 Difference]: With dead ends: 3375 [2019-12-27 02:18:51,799 INFO L226 Difference]: Without dead ends: 3375 [2019-12-27 02:18:51,799 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 02:18:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2019-12-27 02:18:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 2981. [2019-12-27 02:18:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2981 states. [2019-12-27 02:18:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 8445 transitions. [2019-12-27 02:18:51,901 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 8445 transitions. Word has length 67 [2019-12-27 02:18:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:51,901 INFO L462 AbstractCegarLoop]: Abstraction has 2981 states and 8445 transitions. [2019-12-27 02:18:51,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 8445 transitions. [2019-12-27 02:18:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:18:51,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:51,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:51,909 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:51,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1583995874, now seen corresponding path program 1 times [2019-12-27 02:18:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:51,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243043749] [2019-12-27 02:18:51,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:53,660 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 02:18:53,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243043749] [2019-12-27 02:18:53,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:53,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-12-27 02:18:53,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116096907] [2019-12-27 02:18:53,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 02:18:53,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 02:18:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2019-12-27 02:18:53,662 INFO L87 Difference]: Start difference. First operand 2981 states and 8445 transitions. Second operand 31 states. [2019-12-27 02:19:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:02,748 INFO L93 Difference]: Finished difference Result 7873 states and 22191 transitions. [2019-12-27 02:19:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-27 02:19:02,748 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2019-12-27 02:19:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:02,757 INFO L225 Difference]: With dead ends: 7873 [2019-12-27 02:19:02,757 INFO L226 Difference]: Without dead ends: 7849 [2019-12-27 02:19:02,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1082, Invalid=7108, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 02:19:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2019-12-27 02:19:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 3634. [2019-12-27 02:19:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2019-12-27 02:19:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 10223 transitions. [2019-12-27 02:19:02,831 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 10223 transitions. Word has length 68 [2019-12-27 02:19:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:02,831 INFO L462 AbstractCegarLoop]: Abstraction has 3634 states and 10223 transitions. [2019-12-27 02:19:02,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 02:19:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 10223 transitions. [2019-12-27 02:19:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:19:02,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:02,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:02,835 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:02,836 INFO L82 PathProgramCache]: Analyzing trace with hash 25421884, now seen corresponding path program 2 times [2019-12-27 02:19:02,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:02,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511852873] [2019-12-27 02:19:02,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:03,183 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 02:19:03,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511852873] [2019-12-27 02:19:03,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:03,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:19:03,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586266752] [2019-12-27 02:19:03,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:19:03,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:19:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:19:03,186 INFO L87 Difference]: Start difference. First operand 3634 states and 10223 transitions. Second operand 15 states. [2019-12-27 02:19:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:04,661 INFO L93 Difference]: Finished difference Result 7785 states and 22029 transitions. [2019-12-27 02:19:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 02:19:04,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 02:19:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:04,672 INFO L225 Difference]: With dead ends: 7785 [2019-12-27 02:19:04,672 INFO L226 Difference]: Without dead ends: 7761 [2019-12-27 02:19:04,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 02:19:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7761 states. [2019-12-27 02:19:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7761 to 4756. [2019-12-27 02:19:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4756 states. [2019-12-27 02:19:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 13434 transitions. [2019-12-27 02:19:04,760 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 13434 transitions. Word has length 68 [2019-12-27 02:19:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:04,760 INFO L462 AbstractCegarLoop]: Abstraction has 4756 states and 13434 transitions. [2019-12-27 02:19:04,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:19:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 13434 transitions. [2019-12-27 02:19:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:19:04,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:04,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:04,765 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1734168910, now seen corresponding path program 3 times [2019-12-27 02:19:04,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:04,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166254344] [2019-12-27 02:19:04,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:05,033 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 02:19:05,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166254344] [2019-12-27 02:19:05,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:05,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:19:05,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753485718] [2019-12-27 02:19:05,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:19:05,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:19:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:19:05,035 INFO L87 Difference]: Start difference. First operand 4756 states and 13434 transitions. Second operand 13 states. [2019-12-27 02:19:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:05,661 INFO L93 Difference]: Finished difference Result 7216 states and 20199 transitions. [2019-12-27 02:19:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:19:05,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 02:19:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:05,672 INFO L225 Difference]: With dead ends: 7216 [2019-12-27 02:19:05,672 INFO L226 Difference]: Without dead ends: 7190 [2019-12-27 02:19:05,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:19:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7190 states. [2019-12-27 02:19:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7190 to 4889. [2019-12-27 02:19:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4889 states. [2019-12-27 02:19:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 13819 transitions. [2019-12-27 02:19:05,751 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 13819 transitions. Word has length 68 [2019-12-27 02:19:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:05,751 INFO L462 AbstractCegarLoop]: Abstraction has 4889 states and 13819 transitions. [2019-12-27 02:19:05,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:19:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 13819 transitions. [2019-12-27 02:19:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:19:05,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:05,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:05,758 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1138948950, now seen corresponding path program 4 times [2019-12-27 02:19:05,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:05,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091116915] [2019-12-27 02:19:05,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:06,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 02:19:06,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091116915] [2019-12-27 02:19:06,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:06,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:19:06,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070886372] [2019-12-27 02:19:06,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:19:06,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:19:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:19:06,098 INFO L87 Difference]: Start difference. First operand 4889 states and 13819 transitions. Second operand 15 states. [2019-12-27 02:19:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:07,294 INFO L93 Difference]: Finished difference Result 7696 states and 21454 transitions. [2019-12-27 02:19:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 02:19:07,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 02:19:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:07,305 INFO L225 Difference]: With dead ends: 7696 [2019-12-27 02:19:07,305 INFO L226 Difference]: Without dead ends: 7672 [2019-12-27 02:19:07,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=1171, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 02:19:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-12-27 02:19:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 4967. [2019-12-27 02:19:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4967 states. [2019-12-27 02:19:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 13970 transitions. [2019-12-27 02:19:07,388 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 13970 transitions. Word has length 68 [2019-12-27 02:19:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:07,389 INFO L462 AbstractCegarLoop]: Abstraction has 4967 states and 13970 transitions. [2019-12-27 02:19:07,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:19:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 13970 transitions. [2019-12-27 02:19:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:19:07,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:07,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:07,395 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1526775698, now seen corresponding path program 5 times [2019-12-27 02:19:07,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:07,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189244494] [2019-12-27 02:19:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:07,660 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 02:19:07,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189244494] [2019-12-27 02:19:07,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:19:07,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2348324] [2019-12-27 02:19:07,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 02:19:07,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 02:19:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:19:07,721 INFO L87 Difference]: Start difference. First operand 4967 states and 13970 transitions. Second operand 14 states. [2019-12-27 02:19:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:08,381 INFO L93 Difference]: Finished difference Result 8204 states and 22973 transitions. [2019-12-27 02:19:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:19:08,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 02:19:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:08,394 INFO L225 Difference]: With dead ends: 8204 [2019-12-27 02:19:08,394 INFO L226 Difference]: Without dead ends: 8180 [2019-12-27 02:19:08,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:19:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2019-12-27 02:19:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 5021. [2019-12-27 02:19:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5021 states. [2019-12-27 02:19:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 14123 transitions. [2019-12-27 02:19:08,487 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 14123 transitions. Word has length 68 [2019-12-27 02:19:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:08,487 INFO L462 AbstractCegarLoop]: Abstraction has 5021 states and 14123 transitions. [2019-12-27 02:19:08,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 02:19:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 14123 transitions. [2019-12-27 02:19:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:19:08,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:08,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:08,492 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash 829115294, now seen corresponding path program 6 times [2019-12-27 02:19:08,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:08,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589509294] [2019-12-27 02:19:08,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:19:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:19:08,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:19:08,618 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:19:08,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t891~0.base_24| 4) |v_#length_21|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t891~0.base_24|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24|)) (= 0 v_~__unbuffered_p1_EAX~0_77) (= v_~__unbuffered_cnt~0_133 0) (= 0 |v_ULTIMATE.start_main_~#t891~0.offset_17|) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_162) (= v_~a~0_11 0) (= v_~x$r_buff1_thd0~0_242 0) (= v_~x$mem_tmp~0_19 0) (= v_~x$r_buff1_thd1~0_183 0) (= 0 v_~x$r_buff1_thd2~0_137) (= 0 v_~x$r_buff0_thd2~0_211) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24| 1)) (= v_~main$tmp_guard0~0_27 0) (= v_~x$r_buff0_thd0~0_328 0) (= v_~main$tmp_guard1~0_21 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y~0_70 0) (= 0 v_~x$r_buff0_thd3~0_142) (= 0 v_~weak$$choice2~0_94) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x$w_buff0~0_417) (= v_~x$r_buff0_thd1~0_166 0) (= v_~x$flush_delayed~0_36 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$r_buff1_thd3~0_132) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24|) |v_ULTIMATE.start_main_~#t891~0.offset_17| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1_used~0_523) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_19 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~z~0_71 0) (= 0 v_~__unbuffered_p2_EAX~0_20) (= v_~__unbuffered_p1_EBX~0_78 0) (= 0 v_~x$w_buff1~0_278) (= 0 v_~x$w_buff0_used~0_807))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_19|, ~x$w_buff0~0=v_~x$w_buff0~0_417, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_39|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_33|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_142, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_27|, ~a~0=v_~a~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_77, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|, ~x$w_buff1~0=v_~x$w_buff1~0_278, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_523, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_137, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_77|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_142|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_162, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_166, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_19|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_18|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_29|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_109|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_20|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_86|, ULTIMATE.start_main_~#t891~0.offset=|v_ULTIMATE.start_main_~#t891~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_78, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_~#t891~0.base=|v_ULTIMATE.start_main_~#t891~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_242, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_43|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_14|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_84|, ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_20|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ~b~0=v_~b~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_71, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t891~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t891~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t893~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t892~0.base, ~x$read_delayed_var~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t892~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:19:08,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L827-1-->L829: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10|) |v_ULTIMATE.start_main_~#t892~0.offset_10| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t892~0.base_10| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t892~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t892~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t892~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t892~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t892~0.offset] because there is no mapped edge [2019-12-27 02:19:08,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L829-1-->L831: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t893~0.base_12| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12|) |v_ULTIMATE.start_main_~#t893~0.offset_10| 2))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t893~0.base_12|) (= |v_ULTIMATE.start_main_~#t893~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t893~0.base_12|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t893~0.offset] because there is no mapped edge [2019-12-27 02:19:08,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L4-->L778: Formula: (and (= ~x$r_buff1_thd0~0_Out1438893073 ~x$r_buff0_thd0~0_In1438893073) (not (= P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1438893073 0)) (= ~x$r_buff0_thd2~0_Out1438893073 1) (= ~z~0_In1438893073 ~__unbuffered_p1_EBX~0_Out1438893073) (= ~y~0_Out1438893073 1) (= ~x$r_buff1_thd2~0_Out1438893073 ~x$r_buff0_thd2~0_In1438893073) (= ~y~0_Out1438893073 ~__unbuffered_p1_EAX~0_Out1438893073) (= ~x$r_buff1_thd3~0_Out1438893073 ~x$r_buff0_thd3~0_In1438893073) (= ~x$r_buff0_thd1~0_In1438893073 ~x$r_buff1_thd1~0_Out1438893073)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1438893073, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1438893073, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1438893073, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1438893073, ~z~0=~z~0_In1438893073, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1438893073} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1438893073, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1438893073, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1438893073, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1438893073, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1438893073, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1438893073, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1438893073, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1438893073, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1438893073, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In1438893073, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1438893073, ~z~0=~z~0_In1438893073, ~y~0=~y~0_Out1438893073} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~y~0] because there is no mapped edge [2019-12-27 02:19:08,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-7772003 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-7772003 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-7772003|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-7772003 |P1Thread1of1ForFork2_#t~ite11_Out-7772003|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-7772003, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-7772003} OutVars{P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-7772003|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-7772003, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-7772003} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:19:08,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L804-2-->L804-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1490862129 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1490862129 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite15_Out1490862129| ~x~0_In1490862129)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite15_Out1490862129| ~x$w_buff1~0_In1490862129) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1490862129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1490862129, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1490862129, ~x~0=~x~0_In1490862129} OutVars{P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out1490862129|, ~x$w_buff1~0=~x$w_buff1~0_In1490862129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1490862129, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1490862129, ~x~0=~x~0_In1490862129} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 02:19:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L804-4-->L805: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork0_#t~ite15_8|) InVars {P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_8|} OutVars{P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_7|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 02:19:08,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1321112935 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1321112935 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite17_Out-1321112935| ~x$w_buff0_used~0_In-1321112935)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite17_Out-1321112935| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1321112935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321112935} OutVars{P2Thread1of1ForFork0_#t~ite17=|P2Thread1of1ForFork0_#t~ite17_Out-1321112935|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1321112935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321112935} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-27 02:19:08,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1852969672 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1852969672 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1852969672 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1852969672 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite18_Out1852969672| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite18_Out1852969672| ~x$w_buff1_used~0_In1852969672)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1852969672, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1852969672, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1852969672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852969672} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1852969672, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1852969672, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1852969672, P2Thread1of1ForFork0_#t~ite18=|P2Thread1of1ForFork0_#t~ite18_Out1852969672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852969672} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite18] because there is no mapped edge [2019-12-27 02:19:08,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In166984048 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In166984048 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite19_Out166984048| ~x$r_buff0_thd3~0_In166984048) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite19_Out166984048| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166984048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166984048} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166984048, P2Thread1of1ForFork0_#t~ite19=|P2Thread1of1ForFork0_#t~ite19_Out166984048|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166984048} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:19:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In538631652 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In538631652 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In538631652 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In538631652 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite20_Out538631652| ~x$r_buff1_thd3~0_In538631652)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out538631652| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In538631652, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In538631652, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In538631652, ~x$w_buff0_used~0=~x$w_buff0_used~0_In538631652} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In538631652, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In538631652, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In538631652, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out538631652|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In538631652} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 02:19:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~x$r_buff1_thd3~0_64 |v_P2Thread1of1ForFork0_#t~ite20_36|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_36|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_35|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:19:08,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L743-2-->L743-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-2113734604 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-2113734604 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite3_Out-2113734604| |P0Thread1of1ForFork1_#t~ite4_Out-2113734604|))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite3_Out-2113734604| ~x$w_buff1~0_In-2113734604) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork1_#t~ite3_Out-2113734604| ~x~0_In-2113734604) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2113734604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2113734604, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2113734604, ~x~0=~x~0_In-2113734604} OutVars{P0Thread1of1ForFork1_#t~ite4=|P0Thread1of1ForFork1_#t~ite4_Out-2113734604|, P0Thread1of1ForFork1_#t~ite3=|P0Thread1of1ForFork1_#t~ite3_Out-2113734604|, ~x$w_buff1~0=~x$w_buff1~0_In-2113734604, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2113734604, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2113734604, ~x~0=~x~0_In-2113734604} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 02:19:08,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1650057863 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1650057863 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1650057863 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1650057863 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1650057863|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1650057863| ~x$w_buff1_used~0_In-1650057863) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650057863, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1650057863, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650057863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650057863} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650057863, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1650057863, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1650057863|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650057863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650057863} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:19:08,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L781-->L782: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1263424249 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1263424249 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1263424249 ~x$r_buff0_thd2~0_Out-1263424249)) (and (= 0 ~x$r_buff0_thd2~0_Out-1263424249) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1263424249, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263424249} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1263424249, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1263424249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263424249} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:19:08,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In344923765 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In344923765 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In344923765 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In344923765 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out344923765|)) (and (= ~x$r_buff1_thd2~0_In344923765 |P1Thread1of1ForFork2_#t~ite14_Out344923765|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In344923765, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In344923765, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In344923765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344923765} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In344923765, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In344923765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out344923765|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In344923765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344923765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:19:08,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L782-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork2_#t~ite14_42|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_42|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_41|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:19:08,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-926910386 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-926910386 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-926910386| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-926910386| ~x$w_buff0_used~0_In-926910386) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-926910386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-926910386} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-926910386|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-926910386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-926910386} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:19:08,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L745-->L745-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1592581263 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1592581263 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1592581263 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1592581263 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1592581263| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite6_Out1592581263| ~x$w_buff1_used~0_In1592581263)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1592581263, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1592581263, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1592581263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592581263} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1592581263, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1592581263|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1592581263, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1592581263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592581263} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:19:08,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1240437222 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1240437222 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1240437222 |P0Thread1of1ForFork1_#t~ite7_Out-1240437222|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite7_Out-1240437222|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1240437222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240437222} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1240437222, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1240437222|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240437222} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 02:19:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2064377971 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2064377971 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2064377971 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2064377971 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-2064377971| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-2064377971| ~x$r_buff1_thd1~0_In-2064377971) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2064377971, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064377971, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2064377971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2064377971} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2064377971, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2064377971|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064377971, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2064377971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2064377971} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:19:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L747-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 02:19:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L831-1-->L837: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:19:08,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L837-2-->L837-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-2008909246| |ULTIMATE.start_main_#t~ite24_Out-2008909246|)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2008909246 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2008909246 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-2008909246 |ULTIMATE.start_main_#t~ite24_Out-2008909246|)) (and (= ~x$w_buff1~0_In-2008909246 |ULTIMATE.start_main_#t~ite24_Out-2008909246|) .cse0 (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2008909246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2008909246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2008909246, ~x~0=~x~0_In-2008909246} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2008909246, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2008909246|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-2008909246|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2008909246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2008909246, ~x~0=~x~0_In-2008909246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 02:19:08,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1535473649 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1535473649 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1535473649 |ULTIMATE.start_main_#t~ite26_Out1535473649|)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1535473649|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1535473649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535473649} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1535473649, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1535473649|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535473649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 02:19:08,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In1568043101 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1568043101 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1568043101 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1568043101 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1568043101|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1568043101 |ULTIMATE.start_main_#t~ite27_Out1568043101|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568043101, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1568043101, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1568043101, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568043101} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568043101, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1568043101, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1568043101|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1568043101, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568043101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 02:19:08,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2136204825 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-2136204825 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-2136204825|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-2136204825 |ULTIMATE.start_main_#t~ite28_Out-2136204825|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136204825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136204825} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136204825, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-2136204825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136204825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 02:19:08,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L841-->L841-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-601331013 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-601331013 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-601331013 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-601331013 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-601331013| ~x$r_buff1_thd0~0_In-601331013)) (and (= |ULTIMATE.start_main_#t~ite29_Out-601331013| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-601331013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-601331013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-601331013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-601331013} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-601331013, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-601331013|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-601331013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-601331013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-601331013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 02:19:08,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L849-->L849-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-498072531 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-498072531 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-498072531 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-498072531 256))) (and (= (mod ~x$r_buff1_thd0~0_In-498072531 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite36_Out-498072531| |ULTIMATE.start_main_#t~ite35_Out-498072531|) .cse1 (= ~x$w_buff0~0_In-498072531 |ULTIMATE.start_main_#t~ite35_Out-498072531|)) (and (= |ULTIMATE.start_main_#t~ite35_In-498072531| |ULTIMATE.start_main_#t~ite35_Out-498072531|) (= ~x$w_buff0~0_In-498072531 |ULTIMATE.start_main_#t~ite36_Out-498072531|) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-498072531, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-498072531, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-498072531|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498072531, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-498072531, ~weak$$choice2~0=~weak$$choice2~0_In-498072531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498072531} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-498072531, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-498072531, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-498072531|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-498072531|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498072531, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-498072531, ~weak$$choice2~0=~weak$$choice2~0_In-498072531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498072531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:19:08,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1232655674 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1232655674| |ULTIMATE.start_main_#t~ite38_Out-1232655674|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1232655674 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-1232655674 256) 0) .cse0) (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1232655674 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1232655674 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out-1232655674| ~x$w_buff1~0_In-1232655674)) (and (= |ULTIMATE.start_main_#t~ite38_In-1232655674| |ULTIMATE.start_main_#t~ite38_Out-1232655674|) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1232655674| ~x$w_buff1~0_In-1232655674)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1232655674, ~x$w_buff1~0=~x$w_buff1~0_In-1232655674, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1232655674, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1232655674|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1232655674, ~weak$$choice2~0=~weak$$choice2~0_In-1232655674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232655674} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1232655674, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1232655674|, ~x$w_buff1~0=~x$w_buff1~0_In-1232655674, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1232655674, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1232655674|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1232655674, ~weak$$choice2~0=~weak$$choice2~0_In-1232655674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232655674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:19:08,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L851-->L851-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1009869076 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_In1009869076| |ULTIMATE.start_main_#t~ite41_Out1009869076|) (= ~x$w_buff0_used~0_In1009869076 |ULTIMATE.start_main_#t~ite42_Out1009869076|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite41_Out1009869076| |ULTIMATE.start_main_#t~ite42_Out1009869076|) (= ~x$w_buff0_used~0_In1009869076 |ULTIMATE.start_main_#t~ite41_Out1009869076|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1009869076 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In1009869076 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In1009869076 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1009869076 256))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1009869076, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1009869076|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1009869076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1009869076, ~weak$$choice2~0=~weak$$choice2~0_In1009869076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1009869076} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1009869076, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1009869076|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1009869076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1009869076, ~weak$$choice2~0=~weak$$choice2~0_In1009869076, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1009869076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1009869076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:19:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L853-->L854: Formula: (and (= v_~x$r_buff0_thd0~0_126 v_~x$r_buff0_thd0~0_125) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:19:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L854-->L854-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1147688485 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1147688485 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1147688485 256))) (= 0 (mod ~x$w_buff0_used~0_In1147688485 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1147688485 256) 0)))) (= ~x$r_buff1_thd0~0_In1147688485 |ULTIMATE.start_main_#t~ite50_Out1147688485|) (= |ULTIMATE.start_main_#t~ite51_Out1147688485| |ULTIMATE.start_main_#t~ite50_Out1147688485|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite50_In1147688485| |ULTIMATE.start_main_#t~ite50_Out1147688485|) (= |ULTIMATE.start_main_#t~ite51_Out1147688485| ~x$r_buff1_thd0~0_In1147688485)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In1147688485|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1147688485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147688485, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1147688485, ~weak$$choice2~0=~weak$$choice2~0_In1147688485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147688485} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1147688485|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1147688485, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1147688485|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1147688485, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1147688485, ~weak$$choice2~0=~weak$$choice2~0_In1147688485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147688485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:19:08,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L856-->L859-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_14 v_~x~0_125) (not (= 0 (mod v_~x$flush_delayed~0_29 256))) (= v_~x$flush_delayed~0_28 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:19:08,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L859-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:19:08,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:19:08 BasicIcfg [2019-12-27 02:19:08,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:19:08,745 INFO L168 Benchmark]: Toolchain (without parser) took 90221.95 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,745 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.60 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 155.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.05 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,748 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,752 INFO L168 Benchmark]: RCFGBuilder took 868.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 99.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,753 INFO L168 Benchmark]: TraceAbstraction took 88508.08 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 02:19:08,757 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.60 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 155.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.05 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 99.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88508.08 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 92 ProgramPointsAfterwards, 216 TransitionsBefore, 99 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 34 ChoiceCompositions, 6446 VarBasedMoverChecksPositive, 230 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 82137 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L829] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 2 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L831] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 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) [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 b = 1 [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 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 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L743] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L837] EXPR 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L838] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L841] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L845] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L846] 0 x$flush_delayed = weak$$choice2 [L847] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L849] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L850] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L851] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L852] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L852] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4072 SDtfs, 5570 SDslu, 15672 SDs, 0 SdLazy, 15467 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 92 SyntacticMatches, 34 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147565occurred 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: 29.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 89180 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1316 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1224 ConstructedInterpolants, 0 QuantifiedInterpolants, 412431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...