/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:08:36,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:08:36,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:08:36,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:08:36,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:08:36,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:08:36,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:08:36,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:08:36,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:08:36,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:08:36,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:08:36,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:08:36,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:08:36,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:08:36,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:08:36,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:08:36,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:08:36,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:08:36,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:08:36,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:08:36,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:08:36,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:08:36,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:08:36,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:08:36,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:08:36,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:08:36,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:08:36,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:08:36,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:08:36,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:08:36,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:08:36,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:08:36,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:08:36,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:08:36,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:08:36,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:08:36,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:08:36,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:08:36,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:08:36,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:08:36,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:08:36,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:08:36,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:08:36,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:08:36,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:08:36,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:08:36,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:08:36,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:08:36,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:08:36,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:08:36,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:08:36,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:08:36,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:08:36,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:08:36,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:08:36,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:08:36,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:08:36,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:08:36,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:08:36,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:08:36,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:08:36,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:08:36,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:08:36,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:36,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:08:36,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:08:36,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:08:36,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:08:36,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:08:36,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:08:36,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:08:36,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:08:36,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:08:36,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:08:36,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:08:36,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:08:36,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:08:36,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-27 07:08:36,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2b802af/2385983509684c9782c759c83f29ce33/FLAG80d74c2ff [2019-12-27 07:08:37,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:08:37,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-27 07:08:37,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2b802af/2385983509684c9782c759c83f29ce33/FLAG80d74c2ff [2019-12-27 07:08:37,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2b802af/2385983509684c9782c759c83f29ce33 [2019-12-27 07:08:37,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:08:37,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:08:37,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:37,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:08:37,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:08:37,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37, skipping insertion in model container [2019-12-27 07:08:37,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:08:37,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:08:37,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:37,978 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:08:38,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:38,112 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:08:38,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38 WrapperNode [2019-12-27 07:08:38,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:38,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:38,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:08:38,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:08:38,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:38,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:08:38,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:08:38,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:08:38,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... [2019-12-27 07:08:38,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:08:38,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:08:38,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:08:38,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:08:38,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:38,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:08:38,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:08:38,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:08:38,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:08:38,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:08:38,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:08:38,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:08:38,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:08:38,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:08:38,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:08:38,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:08:38,306 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:08:38,989 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:08:38,990 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:08:38,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:38 BoogieIcfgContainer [2019-12-27 07:08:38,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:08:38,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:08:38,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:08:38,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:08:38,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:37" (1/3) ... [2019-12-27 07:08:38,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd2a372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:38, skipping insertion in model container [2019-12-27 07:08:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:38" (2/3) ... [2019-12-27 07:08:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd2a372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:38, skipping insertion in model container [2019-12-27 07:08:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:38" (3/3) ... [2019-12-27 07:08:39,000 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-12-27 07:08:39,011 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:08:39,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:08:39,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:08:39,021 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:08:39,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,063 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,063 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:39,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:08:39,161 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:08:39,161 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:08:39,161 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:08:39,161 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:08:39,161 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:08:39,162 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:08:39,162 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:08:39,162 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:08:39,179 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 07:08:39,181 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:39,292 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:39,293 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:39,312 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:39,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:39,408 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:39,408 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:39,418 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:39,435 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 07:08:39,436 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:08:42,333 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:08:42,463 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:08:42,512 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-27 07:08:42,512 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 07:08:42,515 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-27 07:08:42,892 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-27 07:08:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-27 07:08:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:08:42,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:42,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:08:42,902 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-27 07:08:42,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:42,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009309899] [2019-12-27 07:08:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:43,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009309899] [2019-12-27 07:08:43,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:43,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:43,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421722677] [2019-12-27 07:08:43,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:43,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:43,197 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-27 07:08:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:43,538 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-27 07:08:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:43,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:08:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:43,614 INFO L225 Difference]: With dead ends: 6863 [2019-12-27 07:08:43,615 INFO L226 Difference]: Without dead ends: 6460 [2019-12-27 07:08:43,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-27 07:08:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-27 07:08:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-27 07:08:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-27 07:08:44,057 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-27 07:08:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:44,057 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-27 07:08:44,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-27 07:08:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:08:44,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:44,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:44,062 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-27 07:08:44,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:44,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299225688] [2019-12-27 07:08:44,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:44,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299225688] [2019-12-27 07:08:44,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:44,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:44,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009147605] [2019-12-27 07:08:44,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:44,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:44,147 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-27 07:08:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:44,570 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-27 07:08:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:44,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:08:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:44,670 INFO L225 Difference]: With dead ends: 9760 [2019-12-27 07:08:44,671 INFO L226 Difference]: Without dead ends: 9746 [2019-12-27 07:08:44,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-27 07:08:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-27 07:08:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-27 07:08:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-27 07:08:45,139 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-27 07:08:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:45,140 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-27 07:08:45,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-27 07:08:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:45,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:45,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:45,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-27 07:08:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:45,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030907348] [2019-12-27 07:08:45,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030907348] [2019-12-27 07:08:45,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253968234] [2019-12-27 07:08:45,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:45,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:45,203 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-27 07:08:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:45,487 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-27 07:08:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:45,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:08:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:45,581 INFO L225 Difference]: With dead ends: 12018 [2019-12-27 07:08:45,581 INFO L226 Difference]: Without dead ends: 12018 [2019-12-27 07:08:45,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-27 07:08:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-27 07:08:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-27 07:08:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-27 07:08:46,164 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-27 07:08:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:46,165 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-27 07:08:46,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-27 07:08:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:46,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:46,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:46,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:46,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-27 07:08:46,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:46,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491254632] [2019-12-27 07:08:46,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:46,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491254632] [2019-12-27 07:08:46,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:46,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:46,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477456392] [2019-12-27 07:08:46,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:46,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:46,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:46,237 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-27 07:08:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:47,060 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-27 07:08:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:47,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:47,119 INFO L225 Difference]: With dead ends: 13296 [2019-12-27 07:08:47,119 INFO L226 Difference]: Without dead ends: 13285 [2019-12-27 07:08:47,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-27 07:08:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-27 07:08:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-27 07:08:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-27 07:08:47,709 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-27 07:08:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:47,710 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-27 07:08:47,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-27 07:08:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:47,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:47,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:47,716 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-27 07:08:47,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:47,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356977393] [2019-12-27 07:08:47,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:47,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356977393] [2019-12-27 07:08:47,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:47,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:47,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748529514] [2019-12-27 07:08:47,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:47,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:47,830 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-27 07:08:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,187 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-27 07:08:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:48,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,269 INFO L225 Difference]: With dead ends: 14351 [2019-12-27 07:08:48,270 INFO L226 Difference]: Without dead ends: 14338 [2019-12-27 07:08:48,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-27 07:08:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-27 07:08:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-27 07:08:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-27 07:08:48,737 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-27 07:08:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,738 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-27 07:08:48,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-27 07:08:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:08:48,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:48,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-27 07:08:48,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571420179] [2019-12-27 07:08:48,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:48,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571420179] [2019-12-27 07:08:48,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:48,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079373008] [2019-12-27 07:08:48,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:48,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:48,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:48,796 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-27 07:08:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,861 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-27 07:08:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:48,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:08:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:49,029 INFO L225 Difference]: With dead ends: 12224 [2019-12-27 07:08:49,029 INFO L226 Difference]: Without dead ends: 12224 [2019-12-27 07:08:49,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-27 07:08:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-27 07:08:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-27 07:08:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-27 07:08:49,368 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-27 07:08:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:49,369 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-27 07:08:49,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-27 07:08:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:08:49,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:49,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:49,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-27 07:08:49,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:49,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190900825] [2019-12-27 07:08:49,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:49,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190900825] [2019-12-27 07:08:49,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:49,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:49,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130881716] [2019-12-27 07:08:49,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:49,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:49,464 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 4 states. [2019-12-27 07:08:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:49,505 INFO L93 Difference]: Finished difference Result 2579 states and 6836 transitions. [2019-12-27 07:08:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:49,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:08:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:49,511 INFO L225 Difference]: With dead ends: 2579 [2019-12-27 07:08:49,511 INFO L226 Difference]: Without dead ends: 1835 [2019-12-27 07:08:49,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-27 07:08:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-12-27 07:08:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-12-27 07:08:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4472 transitions. [2019-12-27 07:08:49,547 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4472 transitions. Word has length 17 [2019-12-27 07:08:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:49,548 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4472 transitions. [2019-12-27 07:08:49,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4472 transitions. [2019-12-27 07:08:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:49,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:49,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:49,552 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-27 07:08:49,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:49,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600626630] [2019-12-27 07:08:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:49,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600626630] [2019-12-27 07:08:49,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:49,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:49,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194154833] [2019-12-27 07:08:49,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:49,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:49,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:49,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:49,638 INFO L87 Difference]: Start difference. First operand 1835 states and 4472 transitions. Second operand 3 states. [2019-12-27 07:08:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:49,688 INFO L93 Difference]: Finished difference Result 2395 states and 5562 transitions. [2019-12-27 07:08:49,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:49,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:49,695 INFO L225 Difference]: With dead ends: 2395 [2019-12-27 07:08:49,695 INFO L226 Difference]: Without dead ends: 2395 [2019-12-27 07:08:49,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-27 07:08:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1775. [2019-12-27 07:08:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-27 07:08:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 4059 transitions. [2019-12-27 07:08:49,733 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 4059 transitions. Word has length 26 [2019-12-27 07:08:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:49,733 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 4059 transitions. [2019-12-27 07:08:49,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 4059 transitions. [2019-12-27 07:08:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:49,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:49,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:49,738 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-27 07:08:49,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:49,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615236074] [2019-12-27 07:08:49,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:49,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615236074] [2019-12-27 07:08:49,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:49,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:49,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309033489] [2019-12-27 07:08:49,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:49,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:49,849 INFO L87 Difference]: Start difference. First operand 1775 states and 4059 transitions. Second operand 5 states. [2019-12-27 07:08:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:50,042 INFO L93 Difference]: Finished difference Result 2308 states and 5281 transitions. [2019-12-27 07:08:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:50,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:08:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:50,048 INFO L225 Difference]: With dead ends: 2308 [2019-12-27 07:08:50,048 INFO L226 Difference]: Without dead ends: 2306 [2019-12-27 07:08:50,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-27 07:08:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1867. [2019-12-27 07:08:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-27 07:08:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4281 transitions. [2019-12-27 07:08:50,086 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4281 transitions. Word has length 26 [2019-12-27 07:08:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:50,089 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4281 transitions. [2019-12-27 07:08:50,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4281 transitions. [2019-12-27 07:08:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:50,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:50,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:50,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-27 07:08:50,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:50,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305639288] [2019-12-27 07:08:50,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:50,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305639288] [2019-12-27 07:08:50,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:50,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:08:50,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756119233] [2019-12-27 07:08:50,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:50,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:50,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:50,185 INFO L87 Difference]: Start difference. First operand 1867 states and 4281 transitions. Second operand 5 states. [2019-12-27 07:08:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:50,611 INFO L93 Difference]: Finished difference Result 2686 states and 6070 transitions. [2019-12-27 07:08:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:08:50,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:08:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:50,619 INFO L225 Difference]: With dead ends: 2686 [2019-12-27 07:08:50,620 INFO L226 Difference]: Without dead ends: 2686 [2019-12-27 07:08:50,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:08:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-27 07:08:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2223. [2019-12-27 07:08:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-27 07:08:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 5041 transitions. [2019-12-27 07:08:50,660 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 5041 transitions. Word has length 26 [2019-12-27 07:08:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:50,661 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 5041 transitions. [2019-12-27 07:08:50,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 5041 transitions. [2019-12-27 07:08:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:50,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:50,667 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] [2019-12-27 07:08:50,667 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-27 07:08:50,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:50,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515921955] [2019-12-27 07:08:50,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515921955] [2019-12-27 07:08:50,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:50,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:50,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796424823] [2019-12-27 07:08:50,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:50,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:50,744 INFO L87 Difference]: Start difference. First operand 2223 states and 5041 transitions. Second operand 5 states. [2019-12-27 07:08:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:50,953 INFO L93 Difference]: Finished difference Result 2722 states and 6169 transitions. [2019-12-27 07:08:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:50,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:50,961 INFO L225 Difference]: With dead ends: 2722 [2019-12-27 07:08:50,961 INFO L226 Difference]: Without dead ends: 2720 [2019-12-27 07:08:50,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-12-27 07:08:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2200. [2019-12-27 07:08:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-12-27 07:08:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 4966 transitions. [2019-12-27 07:08:51,000 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 4966 transitions. Word has length 27 [2019-12-27 07:08:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:51,000 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 4966 transitions. [2019-12-27 07:08:51,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 4966 transitions. [2019-12-27 07:08:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:51,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:51,006 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] [2019-12-27 07:08:51,006 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-27 07:08:51,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:51,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038193231] [2019-12-27 07:08:51,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:51,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038193231] [2019-12-27 07:08:51,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:08:51,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584553854] [2019-12-27 07:08:51,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:51,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:51,121 INFO L87 Difference]: Start difference. First operand 2200 states and 4966 transitions. Second operand 5 states. [2019-12-27 07:08:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:51,193 INFO L93 Difference]: Finished difference Result 1268 states and 2647 transitions. [2019-12-27 07:08:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:51,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:51,198 INFO L225 Difference]: With dead ends: 1268 [2019-12-27 07:08:51,198 INFO L226 Difference]: Without dead ends: 1125 [2019-12-27 07:08:51,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-12-27 07:08:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 981. [2019-12-27 07:08:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-27 07:08:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2051 transitions. [2019-12-27 07:08:51,217 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2051 transitions. Word has length 27 [2019-12-27 07:08:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:51,219 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2051 transitions. [2019-12-27 07:08:51,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2051 transitions. [2019-12-27 07:08:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:51,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:51,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:51,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 464634158, now seen corresponding path program 1 times [2019-12-27 07:08:51,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:51,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503600526] [2019-12-27 07:08:51,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:51,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 07:08:51,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503600526] [2019-12-27 07:08:51,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:51,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:51,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794510638] [2019-12-27 07:08:51,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:51,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:51,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:51,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:51,371 INFO L87 Difference]: Start difference. First operand 981 states and 2051 transitions. Second operand 4 states. [2019-12-27 07:08:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:51,397 INFO L93 Difference]: Finished difference Result 1723 states and 3617 transitions. [2019-12-27 07:08:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:51,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 07:08:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:51,401 INFO L225 Difference]: With dead ends: 1723 [2019-12-27 07:08:51,401 INFO L226 Difference]: Without dead ends: 770 [2019-12-27 07:08:51,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-12-27 07:08:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2019-12-27 07:08:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 07:08:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1614 transitions. [2019-12-27 07:08:51,423 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1614 transitions. Word has length 41 [2019-12-27 07:08:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:51,424 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1614 transitions. [2019-12-27 07:08:51,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1614 transitions. [2019-12-27 07:08:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:51,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:51,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:51,427 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 602720702, now seen corresponding path program 2 times [2019-12-27 07:08:51,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:51,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334875930] [2019-12-27 07:08:51,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:51,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334875930] [2019-12-27 07:08:51,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:51,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293398169] [2019-12-27 07:08:51,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:08:51,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:08:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:51,539 INFO L87 Difference]: Start difference. First operand 770 states and 1614 transitions. Second operand 7 states. [2019-12-27 07:08:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:51,723 INFO L93 Difference]: Finished difference Result 1263 states and 2581 transitions. [2019-12-27 07:08:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:08:51,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 07:08:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:51,727 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 07:08:51,727 INFO L226 Difference]: Without dead ends: 827 [2019-12-27 07:08:51,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:08:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-12-27 07:08:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 783. [2019-12-27 07:08:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-27 07:08:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1614 transitions. [2019-12-27 07:08:51,741 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1614 transitions. Word has length 41 [2019-12-27 07:08:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:51,741 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1614 transitions. [2019-12-27 07:08:51,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:08:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1614 transitions. [2019-12-27 07:08:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:51,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:51,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:51,745 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 261585982, now seen corresponding path program 3 times [2019-12-27 07:08:51,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:51,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443885664] [2019-12-27 07:08:51,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:51,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443885664] [2019-12-27 07:08:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528417897] [2019-12-27 07:08:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:08:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:08:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:08:51,851 INFO L87 Difference]: Start difference. First operand 783 states and 1614 transitions. Second operand 6 states. [2019-12-27 07:08:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:52,232 INFO L93 Difference]: Finished difference Result 913 states and 1857 transitions. [2019-12-27 07:08:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:52,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 07:08:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:52,235 INFO L225 Difference]: With dead ends: 913 [2019-12-27 07:08:52,235 INFO L226 Difference]: Without dead ends: 913 [2019-12-27 07:08:52,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:08:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-27 07:08:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 813. [2019-12-27 07:08:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-27 07:08:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1669 transitions. [2019-12-27 07:08:52,282 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1669 transitions. Word has length 41 [2019-12-27 07:08:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1669 transitions. [2019-12-27 07:08:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:08:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1669 transitions. [2019-12-27 07:08:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:52,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:52,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:52,285 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -645645490, now seen corresponding path program 4 times [2019-12-27 07:08:52,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:52,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916324156] [2019-12-27 07:08:52,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:52,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916324156] [2019-12-27 07:08:52,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:52,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:52,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336273588] [2019-12-27 07:08:52,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:52,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:52,389 INFO L87 Difference]: Start difference. First operand 813 states and 1669 transitions. Second operand 3 states. [2019-12-27 07:08:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:52,401 INFO L93 Difference]: Finished difference Result 811 states and 1664 transitions. [2019-12-27 07:08:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:52,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 07:08:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:52,403 INFO L225 Difference]: With dead ends: 811 [2019-12-27 07:08:52,403 INFO L226 Difference]: Without dead ends: 811 [2019-12-27 07:08:52,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-27 07:08:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 670. [2019-12-27 07:08:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 07:08:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1397 transitions. [2019-12-27 07:08:52,414 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1397 transitions. Word has length 41 [2019-12-27 07:08:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:52,415 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1397 transitions. [2019-12-27 07:08:52,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1397 transitions. [2019-12-27 07:08:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:52,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:52,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:52,417 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 1 times [2019-12-27 07:08:52,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:52,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453707786] [2019-12-27 07:08:52,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:52,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:08:52,550 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:08:52,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= 0 |v_ULTIMATE.start_main_~#t1661~0.offset_17|) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1661~0.base_19| 4)) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= (store .cse0 |v_ULTIMATE.start_main_~#t1661~0.base_19| 1) |v_#valid_38|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1661~0.base_19|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1661~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1661~0.base_19|) |v_ULTIMATE.start_main_~#t1661~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$r_buff1_thd2~0_17) (= (select .cse0 |v_ULTIMATE.start_main_~#t1661~0.base_19|) 0) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1662~0.offset=|v_ULTIMATE.start_main_~#t1662~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1661~0.base=|v_ULTIMATE.start_main_~#t1661~0.base_19|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_~#t1661~0.offset=|v_ULTIMATE.start_main_~#t1661~0.offset_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ULTIMATE.start_main_~#t1662~0.base=|v_ULTIMATE.start_main_~#t1662~0.base_22|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1662~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1661~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1661~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t1662~0.base, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:08:52,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1662~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1662~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1662~0.base_9|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1662~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1662~0.base_9|) |v_ULTIMATE.start_main_~#t1662~0.offset_8| 1))) (= |v_ULTIMATE.start_main_~#t1662~0.offset_8| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1662~0.base_9| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1662~0.base_9| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1662~0.offset=|v_ULTIMATE.start_main_~#t1662~0.offset_8|, ULTIMATE.start_main_~#t1662~0.base=|v_ULTIMATE.start_main_~#t1662~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1662~0.offset, ULTIMATE.start_main_~#t1662~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:08:52,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:08:52,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1918490935 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1918490935 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1918490935| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1918490935| ~y$w_buff0_used~0_In-1918490935)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1918490935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1918490935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1918490935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1918490935, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1918490935|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:08:52,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In99491355 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In99491355 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In99491355 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In99491355 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out99491355| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out99491355| ~y$w_buff1_used~0_In99491355) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In99491355, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99491355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In99491355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99491355} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In99491355, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99491355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In99491355, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out99491355|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99491355} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:08:52,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In435992029 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In435992029 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out435992029)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In435992029 ~y$r_buff0_thd2~0_Out435992029)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In435992029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In435992029} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In435992029, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out435992029|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out435992029} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:08:52,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1679448888 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_Out-1679448888| ~y$w_buff1_used~0_In-1679448888) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1679448888 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1679448888 256))) (= 0 (mod ~y$w_buff0_used~0_In-1679448888 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1679448888 256))))) .cse1 (= |P0Thread1of1ForFork1_#t~ite18_Out-1679448888| |P0Thread1of1ForFork1_#t~ite17_Out-1679448888|)) (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1679448888| ~y$w_buff1_used~0_In-1679448888) (= |P0Thread1of1ForFork1_#t~ite17_In-1679448888| |P0Thread1of1ForFork1_#t~ite17_Out-1679448888|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1679448888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1679448888, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1679448888, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1679448888|, ~weak$$choice2~0=~weak$$choice2~0_In-1679448888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1679448888} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1679448888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1679448888, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1679448888, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1679448888|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1679448888|, ~weak$$choice2~0=~weak$$choice2~0_In-1679448888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1679448888} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:08:52,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:08:52,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 07:08:52,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1935182705 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1935182705 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1935182705 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1935182705 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1935182705|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1935182705 |P1Thread1of1ForFork0_#t~ite31_Out1935182705|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1935182705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935182705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1935182705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935182705} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1935182705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935182705, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1935182705|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1935182705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935182705} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:08:52,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:08:52,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:08:52,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-44280252 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-44280252 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-44280252 |ULTIMATE.start_main_#t~ite34_Out-44280252|)) (and (= |ULTIMATE.start_main_#t~ite34_Out-44280252| ~y$w_buff1~0_In-44280252) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-44280252, ~y~0=~y~0_In-44280252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-44280252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44280252} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-44280252, ~y~0=~y~0_In-44280252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-44280252, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-44280252|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44280252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:52,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:52,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In183034628 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In183034628 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In183034628 |ULTIMATE.start_main_#t~ite36_Out183034628|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out183034628|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In183034628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In183034628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In183034628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In183034628, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out183034628|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 07:08:52,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In892007877 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In892007877 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In892007877 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In892007877 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out892007877| ~y$w_buff1_used~0_In892007877) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite37_Out892007877| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In892007877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In892007877, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In892007877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In892007877} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In892007877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In892007877, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out892007877|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In892007877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In892007877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:08:52,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2108893338 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2108893338 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-2108893338| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-2108893338| ~y$r_buff0_thd0~0_In-2108893338)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108893338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2108893338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108893338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2108893338, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2108893338|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:08:52,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1372105653 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1372105653 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1372105653 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1372105653 256)))) (or (and (= ~y$r_buff1_thd0~0_In1372105653 |ULTIMATE.start_main_#t~ite39_Out1372105653|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite39_Out1372105653| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1372105653, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1372105653, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1372105653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1372105653} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1372105653, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1372105653|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1372105653, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1372105653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1372105653} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:08:52,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:08:52,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:52 BasicIcfg [2019-12-27 07:08:52,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:08:52,659 INFO L168 Benchmark]: Toolchain (without parser) took 15292.37 ms. Allocated memory was 146.3 MB in the beginning and 662.2 MB in the end (delta: 515.9 MB). Free memory was 102.6 MB in the beginning and 510.3 MB in the end (delta: -407.7 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,660 INFO L168 Benchmark]: CDTParser took 1.94 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.00 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 158.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 156.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,662 INFO L168 Benchmark]: Boogie Preprocessor took 38.77 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,664 INFO L168 Benchmark]: RCFGBuilder took 766.44 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 112.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,665 INFO L168 Benchmark]: TraceAbstraction took 13661.60 ms. Allocated memory was 203.9 MB in the beginning and 662.2 MB in the end (delta: 458.2 MB). Free memory was 111.9 MB in the beginning and 510.3 MB in the end (delta: -398.4 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:52,675 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.94 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.00 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 158.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 156.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.77 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.44 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 112.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13661.60 ms. Allocated memory was 203.9 MB in the beginning and 662.2 MB in the end (delta: 458.2 MB). Free memory was 111.9 MB in the beginning and 510.3 MB in the end (delta: -398.4 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1816 SDtfs, 1574 SDslu, 2871 SDs, 0 SdLazy, 1548 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 7555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 31622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...