/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/safe013_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:33:35,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:33:35,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:33:35,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:33:35,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:33:35,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:33:35,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:33:35,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:33:35,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:33:35,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:33:35,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:33:35,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:33:35,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:33:35,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:33:35,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:33:35,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:33:35,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:33:35,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:33:35,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:33:35,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:33:35,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:33:36,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:33:36,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:33:36,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:33:36,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:33:36,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:33:36,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:33:36,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:33:36,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:33:36,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:33:36,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:33:36,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:33:36,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:33:36,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:33:36,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:33:36,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:33:36,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:33:36,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:33:36,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:33:36,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:33:36,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:33:36,015 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-18 22:33:36,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:33:36,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:33:36,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:33:36,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:33:36,037 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:33:36,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:33:36,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:33:36,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:33:36,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:33:36,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:33:36,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:33:36,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:33:36,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:33:36,040 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:33:36,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:33:36,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:33:36,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:33:36,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:33:36,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:33:36,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:33:36,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:33:36,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:33:36,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:33:36,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:33:36,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:33:36,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:33:36,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:33:36,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:33:36,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:33:36,336 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:33:36,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-18 22:33:36,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c6b0430/b81c69c8aa9047faa0144c9ab588f149/FLAG49871e3bb [2019-12-18 22:33:36,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:33:36,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-18 22:33:36,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c6b0430/b81c69c8aa9047faa0144c9ab588f149/FLAG49871e3bb [2019-12-18 22:33:37,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c6b0430/b81c69c8aa9047faa0144c9ab588f149 [2019-12-18 22:33:37,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:33:37,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:33:37,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:37,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:33:37,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:33:37,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:37,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37, skipping insertion in model container [2019-12-18 22:33:37,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:37,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:33:37,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:33:37,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:37,846 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:33:37,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:37,997 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:33:37,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37 WrapperNode [2019-12-18 22:33:37,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:37,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:37,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:33:37,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:33:38,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:38,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:33:38,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:33:38,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:33:38,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (1/1) ... [2019-12-18 22:33:38,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:33:38,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:33:38,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:33:38,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:33:38,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (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-18 22:33:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:33:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:33:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:33:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:33:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:33:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:33:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:33:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:33:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:33:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:33:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:33:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:33:38,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:33:38,181 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:33:38,888 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:33:38,888 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:33:38,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:38 BoogieIcfgContainer [2019-12-18 22:33:38,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:33:38,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:33:38,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:33:38,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:33:38,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:33:37" (1/3) ... [2019-12-18 22:33:38,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95de53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:38, skipping insertion in model container [2019-12-18 22:33:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:37" (2/3) ... [2019-12-18 22:33:38,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95de53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:38, skipping insertion in model container [2019-12-18 22:33:38,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:38" (3/3) ... [2019-12-18 22:33:38,902 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.oepc.i [2019-12-18 22:33:38,910 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:33:38,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:33:38,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:33:38,919 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:33:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:38,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,022 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:39,047 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:33:39,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:33:39,066 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:33:39,066 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:33:39,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:33:39,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:33:39,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:33:39,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:33:39,067 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:33:39,088 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:33:39,090 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:39,190 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:39,190 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:39,210 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:39,236 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:39,277 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:39,278 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:39,286 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:39,304 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:33:39,306 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:33:42,908 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:33:43,048 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:33:43,133 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-18 22:33:43,133 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:33:43,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:33:56,809 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:33:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:33:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:33:56,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:56,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:33:56,819 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-18 22:33:56,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:56,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389022362] [2019-12-18 22:33:56,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:57,070 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-18 22:33:57,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389022362] [2019-12-18 22:33:57,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:57,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:33:57,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132518735] [2019-12-18 22:33:57,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:57,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:57,098 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:33:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:58,124 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:33:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:58,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:33:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:58,617 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:33:58,617 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:33:58,619 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-18 22:34:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:34:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:34:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:34:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:34:09,018 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:34:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:09,018 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:34:09,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:34:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:34:09,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:09,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:09,034 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-18 22:34:09,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:09,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558452913] [2019-12-18 22:34:09,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:09,173 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-18 22:34:09,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558452913] [2019-12-18 22:34:09,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:09,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:09,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869220899] [2019-12-18 22:34:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:09,177 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:34:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:13,446 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:34:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:13,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:14,073 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:34:14,074 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:34:14,075 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-18 22:34:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:34:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:34:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:34:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:34:26,021 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:34:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:26,022 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:34:26,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:34:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:34:26,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:26,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:26,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-18 22:34:26,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:26,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9336286] [2019-12-18 22:34:26,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:26,132 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-18 22:34:26,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9336286] [2019-12-18 22:34:26,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:26,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:26,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221373240] [2019-12-18 22:34:26,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:26,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:26,134 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:34:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:27,155 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-18 22:34:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:27,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:29,143 INFO L225 Difference]: With dead ends: 161841 [2019-12-18 22:34:29,144 INFO L226 Difference]: Without dead ends: 161729 [2019-12-18 22:34:29,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-18 22:34:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-18 22:34:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-18 22:34:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-18 22:34:40,322 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-18 22:34:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:40,322 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-18 22:34:40,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-18 22:34:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:40,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:40,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:40,326 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:40,326 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-18 22:34:40,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:40,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326453021] [2019-12-18 22:34:40,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:40,382 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-18 22:34:40,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326453021] [2019-12-18 22:34:40,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:40,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:40,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328890418] [2019-12-18 22:34:40,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:40,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:40,384 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-18 22:34:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:42,328 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-18 22:34:42,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:42,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:34:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:42,928 INFO L225 Difference]: With dead ends: 181948 [2019-12-18 22:34:42,928 INFO L226 Difference]: Without dead ends: 181948 [2019-12-18 22:34:42,929 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-18 22:34:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-18 22:34:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-18 22:34:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-18 22:34:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-18 22:34:57,332 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-18 22:34:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:57,332 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-18 22:34:57,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-18 22:34:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:57,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:57,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:57,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-18 22:34:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:57,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438096917] [2019-12-18 22:34:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:57,423 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-18 22:34:57,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438096917] [2019-12-18 22:34:57,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:57,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:57,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417068803] [2019-12-18 22:34:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:57,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:57,425 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-18 22:35:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:03,425 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-18 22:35:03,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:35:03,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:35:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:03,967 INFO L225 Difference]: With dead ends: 176806 [2019-12-18 22:35:03,967 INFO L226 Difference]: Without dead ends: 176726 [2019-12-18 22:35:03,967 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-18 22:35:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-18 22:35:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-18 22:35:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-18 22:35:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-18 22:35:12,272 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-18 22:35:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:12,273 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-18 22:35:12,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-18 22:35:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:35:12,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:12,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:12,276 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-18 22:35:12,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:12,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386994311] [2019-12-18 22:35:12,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:12,339 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-18 22:35:12,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386994311] [2019-12-18 22:35:12,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:12,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:12,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440681016] [2019-12-18 22:35:12,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:12,341 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-18 22:35:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:13,353 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-18 22:35:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:35:13,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:35:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:20,358 INFO L225 Difference]: With dead ends: 181899 [2019-12-18 22:35:20,359 INFO L226 Difference]: Without dead ends: 181811 [2019-12-18 22:35:20,359 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-18 22:35:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-18 22:35:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-18 22:35:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-18 22:35:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-18 22:35:27,712 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-18 22:35:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-18 22:35:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-18 22:35:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:35:27,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:27,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:27,731 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -757674417, now seen corresponding path program 1 times [2019-12-18 22:35:27,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056750941] [2019-12-18 22:35:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:27,783 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-18 22:35:27,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056750941] [2019-12-18 22:35:27,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:27,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:35:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887675037] [2019-12-18 22:35:27,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:27,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:27,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:27,786 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-18 22:35:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:29,646 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-18 22:35:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:29,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:35:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:30,126 INFO L225 Difference]: With dead ends: 155313 [2019-12-18 22:35:30,126 INFO L226 Difference]: Without dead ends: 155313 [2019-12-18 22:35:30,127 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-18 22:35:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-18 22:35:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-18 22:35:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-18 22:35:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-18 22:35:43,763 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-18 22:35:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:43,763 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-18 22:35:43,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-18 22:35:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:43,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:43,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:43,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash -562123947, now seen corresponding path program 1 times [2019-12-18 22:35:43,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:43,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123311823] [2019-12-18 22:35:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:43,861 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-18 22:35:43,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123311823] [2019-12-18 22:35:43,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:43,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:43,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725122117] [2019-12-18 22:35:43,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:43,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:43,863 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-18 22:35:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:51,528 INFO L93 Difference]: Finished difference Result 243262 states and 1008109 transitions. [2019-12-18 22:35:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:35:51,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:35:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:51,913 INFO L225 Difference]: With dead ends: 243262 [2019-12-18 22:35:51,913 INFO L226 Difference]: Without dead ends: 120708 [2019-12-18 22:35:51,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 22:35:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120708 states. [2019-12-18 22:35:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120708 to 120708. [2019-12-18 22:35:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120708 states. [2019-12-18 22:35:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120708 states to 120708 states and 492233 transitions. [2019-12-18 22:35:58,291 INFO L78 Accepts]: Start accepts. Automaton has 120708 states and 492233 transitions. Word has length 19 [2019-12-18 22:35:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:58,291 INFO L462 AbstractCegarLoop]: Abstraction has 120708 states and 492233 transitions. [2019-12-18 22:35:58,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 120708 states and 492233 transitions. [2019-12-18 22:35:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:58,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:58,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:58,306 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1224805741, now seen corresponding path program 1 times [2019-12-18 22:35:58,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:58,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235383416] [2019-12-18 22:35:58,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:58,426 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-18 22:35:58,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235383416] [2019-12-18 22:35:58,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:58,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:58,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894430285] [2019-12-18 22:35:58,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:58,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:58,429 INFO L87 Difference]: Start difference. First operand 120708 states and 492233 transitions. Second operand 5 states. [2019-12-18 22:35:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:59,609 INFO L93 Difference]: Finished difference Result 160250 states and 638617 transitions. [2019-12-18 22:35:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:59,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:35:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:00,057 INFO L225 Difference]: With dead ends: 160250 [2019-12-18 22:36:00,057 INFO L226 Difference]: Without dead ends: 158095 [2019-12-18 22:36:00,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158095 states. [2019-12-18 22:36:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158095 to 124062. [2019-12-18 22:36:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124062 states. [2019-12-18 22:36:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124062 states to 124062 states and 506459 transitions. [2019-12-18 22:36:12,022 INFO L78 Accepts]: Start accepts. Automaton has 124062 states and 506459 transitions. Word has length 19 [2019-12-18 22:36:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:12,023 INFO L462 AbstractCegarLoop]: Abstraction has 124062 states and 506459 transitions. [2019-12-18 22:36:12,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 124062 states and 506459 transitions. [2019-12-18 22:36:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 22:36:12,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:12,041 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] [2019-12-18 22:36:12,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1903443732, now seen corresponding path program 1 times [2019-12-18 22:36:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:12,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058563377] [2019-12-18 22:36:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:12,082 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-18 22:36:12,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058563377] [2019-12-18 22:36:12,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:12,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:36:12,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034297138] [2019-12-18 22:36:12,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:36:12,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:36:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:12,084 INFO L87 Difference]: Start difference. First operand 124062 states and 506459 transitions. Second operand 3 states. [2019-12-18 22:36:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:14,405 INFO L93 Difference]: Finished difference Result 211901 states and 867827 transitions. [2019-12-18 22:36:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:36:14,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 22:36:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:14,722 INFO L225 Difference]: With dead ends: 211901 [2019-12-18 22:36:14,723 INFO L226 Difference]: Without dead ends: 108903 [2019-12-18 22:36:14,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108903 states. [2019-12-18 22:36:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108903 to 100216. [2019-12-18 22:36:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100216 states. [2019-12-18 22:36:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100216 states to 100216 states and 410838 transitions. [2019-12-18 22:36:26,885 INFO L78 Accepts]: Start accepts. Automaton has 100216 states and 410838 transitions. Word has length 20 [2019-12-18 22:36:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:26,886 INFO L462 AbstractCegarLoop]: Abstraction has 100216 states and 410838 transitions. [2019-12-18 22:36:26,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 100216 states and 410838 transitions. [2019-12-18 22:36:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 22:36:26,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:26,902 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] [2019-12-18 22:36:26,902 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1337451788, now seen corresponding path program 1 times [2019-12-18 22:36:26,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:26,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494276504] [2019-12-18 22:36:26,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:26,970 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-18 22:36:26,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494276504] [2019-12-18 22:36:26,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:26,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:26,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599051557] [2019-12-18 22:36:26,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:36:26,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:36:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:36:26,972 INFO L87 Difference]: Start difference. First operand 100216 states and 410838 transitions. Second operand 4 states. [2019-12-18 22:36:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:27,098 INFO L93 Difference]: Finished difference Result 25112 states and 86930 transitions. [2019-12-18 22:36:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:36:27,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 22:36:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:27,135 INFO L225 Difference]: With dead ends: 25112 [2019-12-18 22:36:27,135 INFO L226 Difference]: Without dead ends: 20261 [2019-12-18 22:36:27,135 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-18 22:36:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20261 states. [2019-12-18 22:36:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20261 to 20261. [2019-12-18 22:36:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20261 states. [2019-12-18 22:36:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20261 states to 20261 states and 67415 transitions. [2019-12-18 22:36:28,139 INFO L78 Accepts]: Start accepts. Automaton has 20261 states and 67415 transitions. Word has length 21 [2019-12-18 22:36:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:28,140 INFO L462 AbstractCegarLoop]: Abstraction has 20261 states and 67415 transitions. [2019-12-18 22:36:28,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:36:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 20261 states and 67415 transitions. [2019-12-18 22:36:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:36:28,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:28,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:28,143 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-18 22:36:28,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:28,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682033984] [2019-12-18 22:36:28,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:28,254 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-18 22:36:28,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682033984] [2019-12-18 22:36:28,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:28,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:28,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605132056] [2019-12-18 22:36:28,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:28,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:28,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:28,256 INFO L87 Difference]: Start difference. First operand 20261 states and 67415 transitions. Second operand 5 states. [2019-12-18 22:36:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:28,553 INFO L93 Difference]: Finished difference Result 20962 states and 68953 transitions. [2019-12-18 22:36:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:28,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:36:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:28,588 INFO L225 Difference]: With dead ends: 20962 [2019-12-18 22:36:28,588 INFO L226 Difference]: Without dead ends: 20643 [2019-12-18 22:36:28,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2019-12-18 22:36:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 20188. [2019-12-18 22:36:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20188 states. [2019-12-18 22:36:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20188 states to 20188 states and 67139 transitions. [2019-12-18 22:36:28,943 INFO L78 Accepts]: Start accepts. Automaton has 20188 states and 67139 transitions. Word has length 22 [2019-12-18 22:36:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:28,943 INFO L462 AbstractCegarLoop]: Abstraction has 20188 states and 67139 transitions. [2019-12-18 22:36:28,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20188 states and 67139 transitions. [2019-12-18 22:36:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:36:28,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:28,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:28,946 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-18 22:36:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136108816] [2019-12-18 22:36:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:29,021 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-18 22:36:29,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136108816] [2019-12-18 22:36:29,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:29,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:29,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293468532] [2019-12-18 22:36:29,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:29,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:29,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:29,025 INFO L87 Difference]: Start difference. First operand 20188 states and 67139 transitions. Second operand 5 states. [2019-12-18 22:36:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:29,329 INFO L93 Difference]: Finished difference Result 20141 states and 66503 transitions. [2019-12-18 22:36:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:29,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:36:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:29,361 INFO L225 Difference]: With dead ends: 20141 [2019-12-18 22:36:29,361 INFO L226 Difference]: Without dead ends: 19723 [2019-12-18 22:36:29,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2019-12-18 22:36:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19122. [2019-12-18 22:36:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 22:36:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 64070 transitions. [2019-12-18 22:36:29,704 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 64070 transitions. Word has length 22 [2019-12-18 22:36:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:29,705 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 64070 transitions. [2019-12-18 22:36:29,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 64070 transitions. [2019-12-18 22:36:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:36:29,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:29,712 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] [2019-12-18 22:36:29,712 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-18 22:36:29,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:29,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824882429] [2019-12-18 22:36:29,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:29,789 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-18 22:36:29,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824882429] [2019-12-18 22:36:29,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:29,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:36:29,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974104478] [2019-12-18 22:36:29,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:29,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:29,793 INFO L87 Difference]: Start difference. First operand 19122 states and 64070 transitions. Second operand 5 states. [2019-12-18 22:36:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:30,441 INFO L93 Difference]: Finished difference Result 7284 states and 22451 transitions. [2019-12-18 22:36:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:36:30,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:36:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:30,454 INFO L225 Difference]: With dead ends: 7284 [2019-12-18 22:36:30,454 INFO L226 Difference]: Without dead ends: 6220 [2019-12-18 22:36:30,455 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-18 22:36:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2019-12-18 22:36:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 6220. [2019-12-18 22:36:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-12-18 22:36:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 18995 transitions. [2019-12-18 22:36:30,577 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 18995 transitions. Word has length 28 [2019-12-18 22:36:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:30,577 INFO L462 AbstractCegarLoop]: Abstraction has 6220 states and 18995 transitions. [2019-12-18 22:36:30,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 18995 transitions. [2019-12-18 22:36:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:36:30,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:30,586 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] [2019-12-18 22:36:30,586 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-18 22:36:30,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:30,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145000293] [2019-12-18 22:36:30,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:30,694 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-18 22:36:30,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145000293] [2019-12-18 22:36:30,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:30,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:36:30,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554462943] [2019-12-18 22:36:30,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:36:30,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:36:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:36:30,696 INFO L87 Difference]: Start difference. First operand 6220 states and 18995 transitions. Second operand 6 states. [2019-12-18 22:36:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:30,805 INFO L93 Difference]: Finished difference Result 5287 states and 16625 transitions. [2019-12-18 22:36:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:36:30,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:36:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:30,817 INFO L225 Difference]: With dead ends: 5287 [2019-12-18 22:36:30,817 INFO L226 Difference]: Without dead ends: 4788 [2019-12-18 22:36:30,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-18 22:36:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4788. [2019-12-18 22:36:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-18 22:36:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 15565 transitions. [2019-12-18 22:36:30,954 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 15565 transitions. Word has length 40 [2019-12-18 22:36:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:30,955 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 15565 transitions. [2019-12-18 22:36:30,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:36:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 15565 transitions. [2019-12-18 22:36:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:30,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:30,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:30,966 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-18 22:36:30,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:30,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019039011] [2019-12-18 22:36:30,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:31,066 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-18 22:36:31,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019039011] [2019-12-18 22:36:31,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:31,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:31,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026875348] [2019-12-18 22:36:31,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:31,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:31,070 INFO L87 Difference]: Start difference. First operand 4788 states and 15565 transitions. Second operand 7 states. [2019-12-18 22:36:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:31,290 INFO L93 Difference]: Finished difference Result 9084 states and 28982 transitions. [2019-12-18 22:36:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:36:31,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:31,304 INFO L225 Difference]: With dead ends: 9084 [2019-12-18 22:36:31,304 INFO L226 Difference]: Without dead ends: 6576 [2019-12-18 22:36:31,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:36:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-18 22:36:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5930. [2019-12-18 22:36:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-12-18 22:36:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 19209 transitions. [2019-12-18 22:36:31,454 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 19209 transitions. Word has length 54 [2019-12-18 22:36:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:31,454 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 19209 transitions. [2019-12-18 22:36:31,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 19209 transitions. [2019-12-18 22:36:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:31,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:31,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:31,470 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-18 22:36:31,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:31,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467063872] [2019-12-18 22:36:31,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:31,567 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-18 22:36:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467063872] [2019-12-18 22:36:31,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:31,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374545308] [2019-12-18 22:36:31,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:31,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:31,570 INFO L87 Difference]: Start difference. First operand 5930 states and 19209 transitions. Second operand 7 states. [2019-12-18 22:36:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:31,828 INFO L93 Difference]: Finished difference Result 11036 states and 34911 transitions. [2019-12-18 22:36:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:36:31,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:31,845 INFO L225 Difference]: With dead ends: 11036 [2019-12-18 22:36:31,845 INFO L226 Difference]: Without dead ends: 8066 [2019-12-18 22:36:31,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:36:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-12-18 22:36:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 7238. [2019-12-18 22:36:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-18 22:36:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 23230 transitions. [2019-12-18 22:36:32,027 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 23230 transitions. Word has length 54 [2019-12-18 22:36:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:32,028 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 23230 transitions. [2019-12-18 22:36:32,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 23230 transitions. [2019-12-18 22:36:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:32,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:32,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:32,042 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-18 22:36:32,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:32,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132628674] [2019-12-18 22:36:32,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:32,147 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-18 22:36:32,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132628674] [2019-12-18 22:36:32,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:32,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:36:32,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160242977] [2019-12-18 22:36:32,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:36:32,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:36:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:32,149 INFO L87 Difference]: Start difference. First operand 7238 states and 23230 transitions. Second operand 8 states. [2019-12-18 22:36:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:32,890 INFO L93 Difference]: Finished difference Result 15765 states and 48235 transitions. [2019-12-18 22:36:32,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:36:32,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 22:36:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:32,912 INFO L225 Difference]: With dead ends: 15765 [2019-12-18 22:36:32,912 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 22:36:32,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:36:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 22:36:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 7278. [2019-12-18 22:36:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7278 states. [2019-12-18 22:36:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 23316 transitions. [2019-12-18 22:36:33,069 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 23316 transitions. Word has length 54 [2019-12-18 22:36:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:33,069 INFO L462 AbstractCegarLoop]: Abstraction has 7278 states and 23316 transitions. [2019-12-18 22:36:33,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:36:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 23316 transitions. [2019-12-18 22:36:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:33,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:33,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:33,078 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-18 22:36:33,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:33,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994035163] [2019-12-18 22:36:33,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:33,189 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-18 22:36:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994035163] [2019-12-18 22:36:33,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:33,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:36:33,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556638517] [2019-12-18 22:36:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:36:33,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:36:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:33,191 INFO L87 Difference]: Start difference. First operand 7278 states and 23316 transitions. Second operand 9 states. [2019-12-18 22:36:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:34,328 INFO L93 Difference]: Finished difference Result 21985 states and 67252 transitions. [2019-12-18 22:36:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:36:34,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:36:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:34,363 INFO L225 Difference]: With dead ends: 21985 [2019-12-18 22:36:34,363 INFO L226 Difference]: Without dead ends: 19611 [2019-12-18 22:36:34,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:36:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2019-12-18 22:36:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 7158. [2019-12-18 22:36:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2019-12-18 22:36:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 22938 transitions. [2019-12-18 22:36:34,580 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 22938 transitions. Word has length 54 [2019-12-18 22:36:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:34,580 INFO L462 AbstractCegarLoop]: Abstraction has 7158 states and 22938 transitions. [2019-12-18 22:36:34,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:36:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 22938 transitions. [2019-12-18 22:36:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:34,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:34,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:34,589 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-18 22:36:34,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:34,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619853337] [2019-12-18 22:36:34,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:34,708 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-18 22:36:34,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619853337] [2019-12-18 22:36:34,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:34,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:36:34,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109061735] [2019-12-18 22:36:34,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:36:34,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:36:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:34,711 INFO L87 Difference]: Start difference. First operand 7158 states and 22938 transitions. Second operand 9 states. [2019-12-18 22:36:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:35,919 INFO L93 Difference]: Finished difference Result 29906 states and 91401 transitions. [2019-12-18 22:36:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:36:35,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:36:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:35,953 INFO L225 Difference]: With dead ends: 29906 [2019-12-18 22:36:35,953 INFO L226 Difference]: Without dead ends: 23860 [2019-12-18 22:36:35,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 22:36:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23860 states. [2019-12-18 22:36:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23860 to 9222. [2019-12-18 22:36:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-12-18 22:36:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 29627 transitions. [2019-12-18 22:36:36,197 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 29627 transitions. Word has length 54 [2019-12-18 22:36:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:36,197 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 29627 transitions. [2019-12-18 22:36:36,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:36:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 29627 transitions. [2019-12-18 22:36:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:36,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:36,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:36,207 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-18 22:36:36,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:36,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17758876] [2019-12-18 22:36:36,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:36,302 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-18 22:36:36,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17758876] [2019-12-18 22:36:36,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:36,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:36:36,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134577150] [2019-12-18 22:36:36,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:36,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:36,304 INFO L87 Difference]: Start difference. First operand 9222 states and 29627 transitions. Second operand 7 states. [2019-12-18 22:36:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:37,079 INFO L93 Difference]: Finished difference Result 20541 states and 63453 transitions. [2019-12-18 22:36:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:36:37,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:37,111 INFO L225 Difference]: With dead ends: 20541 [2019-12-18 22:36:37,111 INFO L226 Difference]: Without dead ends: 20457 [2019-12-18 22:36:37,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:36:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2019-12-18 22:36:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 13774. [2019-12-18 22:36:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13774 states. [2019-12-18 22:36:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13774 states to 13774 states and 42784 transitions. [2019-12-18 22:36:37,446 INFO L78 Accepts]: Start accepts. Automaton has 13774 states and 42784 transitions. Word has length 54 [2019-12-18 22:36:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:37,447 INFO L462 AbstractCegarLoop]: Abstraction has 13774 states and 42784 transitions. [2019-12-18 22:36:37,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13774 states and 42784 transitions. [2019-12-18 22:36:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:37,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:37,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:37,465 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 7 times [2019-12-18 22:36:37,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:37,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597907202] [2019-12-18 22:36:37,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:36:37,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597907202] [2019-12-18 22:36:37,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:37,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:37,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693727530] [2019-12-18 22:36:37,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:36:37,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:36:37,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:36:37,557 INFO L87 Difference]: Start difference. First operand 13774 states and 42784 transitions. Second operand 6 states. [2019-12-18 22:36:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:38,255 INFO L93 Difference]: Finished difference Result 21447 states and 65099 transitions. [2019-12-18 22:36:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:38,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 22:36:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:38,309 INFO L225 Difference]: With dead ends: 21447 [2019-12-18 22:36:38,309 INFO L226 Difference]: Without dead ends: 21337 [2019-12-18 22:36:38,310 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-18 22:36:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21337 states. [2019-12-18 22:36:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21337 to 17792. [2019-12-18 22:36:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17792 states. [2019-12-18 22:36:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17792 states to 17792 states and 55019 transitions. [2019-12-18 22:36:38,885 INFO L78 Accepts]: Start accepts. Automaton has 17792 states and 55019 transitions. Word has length 54 [2019-12-18 22:36:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:38,885 INFO L462 AbstractCegarLoop]: Abstraction has 17792 states and 55019 transitions. [2019-12-18 22:36:38,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:36:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17792 states and 55019 transitions. [2019-12-18 22:36:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:38,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:38,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:38,914 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 8 times [2019-12-18 22:36:38,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:38,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586286242] [2019-12-18 22:36:38,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:38,974 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-18 22:36:38,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586286242] [2019-12-18 22:36:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:38,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:36:38,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018281799] [2019-12-18 22:36:38,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:36:38,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:38,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:36:38,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:38,977 INFO L87 Difference]: Start difference. First operand 17792 states and 55019 transitions. Second operand 3 states. [2019-12-18 22:36:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:39,059 INFO L93 Difference]: Finished difference Result 17790 states and 55014 transitions. [2019-12-18 22:36:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:36:39,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:36:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:39,092 INFO L225 Difference]: With dead ends: 17790 [2019-12-18 22:36:39,093 INFO L226 Difference]: Without dead ends: 17790 [2019-12-18 22:36:39,093 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-18 22:36:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2019-12-18 22:36:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 15448. [2019-12-18 22:36:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2019-12-18 22:36:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 48469 transitions. [2019-12-18 22:36:39,357 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 48469 transitions. Word has length 54 [2019-12-18 22:36:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:39,357 INFO L462 AbstractCegarLoop]: Abstraction has 15448 states and 48469 transitions. [2019-12-18 22:36:39,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 48469 transitions. [2019-12-18 22:36:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:36:39,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:39,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:39,378 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-18 22:36:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588154315] [2019-12-18 22:36:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:39,429 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-18 22:36:39,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588154315] [2019-12-18 22:36:39,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:39,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:36:39,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805863590] [2019-12-18 22:36:39,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:36:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:36:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:39,430 INFO L87 Difference]: Start difference. First operand 15448 states and 48469 transitions. Second operand 3 states. [2019-12-18 22:36:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:39,484 INFO L93 Difference]: Finished difference Result 10874 states and 33734 transitions. [2019-12-18 22:36:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:36:39,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:36:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:39,504 INFO L225 Difference]: With dead ends: 10874 [2019-12-18 22:36:39,504 INFO L226 Difference]: Without dead ends: 10874 [2019-12-18 22:36:39,504 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-18 22:36:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10874 states. [2019-12-18 22:36:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10874 to 10632. [2019-12-18 22:36:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10632 states. [2019-12-18 22:36:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 33043 transitions. [2019-12-18 22:36:39,816 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 33043 transitions. Word has length 55 [2019-12-18 22:36:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:39,817 INFO L462 AbstractCegarLoop]: Abstraction has 10632 states and 33043 transitions. [2019-12-18 22:36:39,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 33043 transitions. [2019-12-18 22:36:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:39,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:39,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:39,828 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-18 22:36:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:39,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558618930] [2019-12-18 22:36:39,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:40,006 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-18 22:36:40,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558618930] [2019-12-18 22:36:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:40,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:36:40,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770943598] [2019-12-18 22:36:40,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:36:40,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:40,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:36:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:36:40,009 INFO L87 Difference]: Start difference. First operand 10632 states and 33043 transitions. Second operand 11 states. [2019-12-18 22:36:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:40,727 INFO L93 Difference]: Finished difference Result 16865 states and 51468 transitions. [2019-12-18 22:36:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:36:40,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:36:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:40,744 INFO L225 Difference]: With dead ends: 16865 [2019-12-18 22:36:40,744 INFO L226 Difference]: Without dead ends: 11731 [2019-12-18 22:36:40,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:36:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11731 states. [2019-12-18 22:36:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11731 to 10875. [2019-12-18 22:36:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10875 states. [2019-12-18 22:36:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10875 states to 10875 states and 33273 transitions. [2019-12-18 22:36:40,915 INFO L78 Accepts]: Start accepts. Automaton has 10875 states and 33273 transitions. Word has length 56 [2019-12-18 22:36:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:40,915 INFO L462 AbstractCegarLoop]: Abstraction has 10875 states and 33273 transitions. [2019-12-18 22:36:40,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:36:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10875 states and 33273 transitions. [2019-12-18 22:36:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:40,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:40,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:40,927 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 2 times [2019-12-18 22:36:40,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:40,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532226643] [2019-12-18 22:36:40,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:41,081 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-18 22:36:41,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532226643] [2019-12-18 22:36:41,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:41,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:36:41,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583279246] [2019-12-18 22:36:41,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:36:41,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:36:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:36:41,084 INFO L87 Difference]: Start difference. First operand 10875 states and 33273 transitions. Second operand 12 states. [2019-12-18 22:36:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:41,661 INFO L93 Difference]: Finished difference Result 12116 states and 36398 transitions. [2019-12-18 22:36:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:36:41,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:36:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:41,678 INFO L225 Difference]: With dead ends: 12116 [2019-12-18 22:36:41,678 INFO L226 Difference]: Without dead ends: 11541 [2019-12-18 22:36:41,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:36:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2019-12-18 22:36:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 10557. [2019-12-18 22:36:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-18 22:36:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32409 transitions. [2019-12-18 22:36:41,847 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32409 transitions. Word has length 56 [2019-12-18 22:36:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:41,847 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32409 transitions. [2019-12-18 22:36:41,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:36:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32409 transitions. [2019-12-18 22:36:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:41,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:41,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:41,859 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 3 times [2019-12-18 22:36:41,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:41,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852314889] [2019-12-18 22:36:41,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:41,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:36:41,962 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:36:41,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_22|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2085~0.base_22|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_22| 1) |v_#valid_56|) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= |v_ULTIMATE.start_main_~#t2085~0.offset_18| 0) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_22|) |v_ULTIMATE.start_main_~#t2085~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2085~0.base_22| 4)) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ULTIMATE.start_main_~#t2085~0.offset=|v_ULTIMATE.start_main_~#t2085~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2085~0.base=|v_ULTIMATE.start_main_~#t2085~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2085~0.offset, ULTIMATE.start_main_~#t2087~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2085~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2087~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2086~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t2086~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:36:41,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2086~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| 4) |v_#length_15|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10| 1) |v_#valid_31|) (= |v_ULTIMATE.start_main_~#t2086~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10|) |v_ULTIMATE.start_main_~#t2086~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2086~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2086~0.base, #length] because there is no mapped edge [2019-12-18 22:36:41,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:36:41,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11|) |v_ULTIMATE.start_main_~#t2087~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2087~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2087~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2087~0.base, ULTIMATE.start_main_~#t2087~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:36:41,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1779843653 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1779843653 256) 0))) (or (and (= ~x~0_In1779843653 |P2Thread1of1ForFork1_#t~ite32_Out1779843653|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1779843653| ~x$w_buff1~0_In1779843653) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1779843653, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1779843653, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1779843653, ~x~0=~x~0_In1779843653} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1779843653|, ~x$w_buff1~0=~x$w_buff1~0_In1779843653, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1779843653, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1779843653, ~x~0=~x~0_In1779843653} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:36:41,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:36:41,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1867967343 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1867967343 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1867967343 |P2Thread1of1ForFork1_#t~ite34_Out1867967343|)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out1867967343| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1867967343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867967343} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1867967343|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1867967343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867967343} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:36:41,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1610712355 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1610712355 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1610712355|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1610712355 |P1Thread1of1ForFork0_#t~ite28_Out1610712355|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1610712355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610712355} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1610712355, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1610712355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610712355} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:36:41,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In298041550 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In298041550 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In298041550 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In298041550 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out298041550| ~x$w_buff1_used~0_In298041550) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite29_Out298041550| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In298041550, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In298041550, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In298041550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298041550} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In298041550, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In298041550, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In298041550, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out298041550|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298041550} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:36:41,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1960976982 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1960976982 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1960976982 ~x$r_buff0_thd2~0_Out1960976982) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out1960976982) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1960976982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960976982} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1960976982|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1960976982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960976982} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:36:41,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In2128995611 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In2128995611 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2128995611 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In2128995611 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out2128995611| ~x$r_buff1_thd2~0_In2128995611) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out2128995611| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2128995611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2128995611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2128995611|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128995611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2128995611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:36:41,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:36:41,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1680615925 256) 0))) (or (and (= ~x$w_buff0~0_In-1680615925 |P0Thread1of1ForFork2_#t~ite8_Out-1680615925|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1680615925 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1680615925 256))) (= (mod ~x$w_buff0_used~0_In-1680615925 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1680615925 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite9_Out-1680615925| |P0Thread1of1ForFork2_#t~ite8_Out-1680615925|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1680615925| ~x$w_buff0~0_In-1680615925) (= |P0Thread1of1ForFork2_#t~ite8_In-1680615925| |P0Thread1of1ForFork2_#t~ite8_Out-1680615925|) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1680615925, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1680615925, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1680615925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1680615925, ~weak$$choice2~0=~weak$$choice2~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1680615925, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1680615925, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1680615925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1680615925|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1680615925, ~weak$$choice2~0=~weak$$choice2~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:36:41,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1700794833 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1700794833 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1700794833 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1700794833 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1700794833 |P2Thread1of1ForFork1_#t~ite35_Out1700794833|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1700794833|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1700794833, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1700794833, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1700794833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700794833} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1700794833|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1700794833, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1700794833, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1700794833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700794833} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:36:41,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In92891076 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In92891076 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In92891076 |P2Thread1of1ForFork1_#t~ite36_Out92891076|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out92891076|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In92891076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92891076} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out92891076|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In92891076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92891076} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:36:41,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In885494838 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In885494838 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In885494838 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In885494838 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out885494838| ~x$r_buff1_thd3~0_In885494838)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out885494838| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In885494838, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In885494838, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In885494838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out885494838|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In885494838, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In885494838, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In885494838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:36:41,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:36:41,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In968178259 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In968178259| |P0Thread1of1ForFork2_#t~ite17_Out968178259|) (= ~x$w_buff1_used~0_In968178259 |P0Thread1of1ForFork2_#t~ite18_Out968178259|)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out968178259| |P0Thread1of1ForFork2_#t~ite17_Out968178259|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In968178259 256)))) (or (and (= (mod ~x$w_buff1_used~0_In968178259 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In968178259 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In968178259 256) 0))) (= ~x$w_buff1_used~0_In968178259 |P0Thread1of1ForFork2_#t~ite17_Out968178259|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In968178259, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In968178259|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In968178259, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In968178259, ~weak$$choice2~0=~weak$$choice2~0_In968178259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968178259} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In968178259, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out968178259|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out968178259|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In968178259, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In968178259, ~weak$$choice2~0=~weak$$choice2~0_In968178259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968178259} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:36:41,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:36:41,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse2 (= |P0Thread1of1ForFork2_#t~ite24_Out1151078418| |P0Thread1of1ForFork2_#t~ite23_Out1151078418|)) (.cse5 (= (mod ~x$w_buff0_used~0_In1151078418 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1151078418 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1151078418 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In1151078418 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In1151078418 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out1151078418|) .cse2 (or (not .cse3) .cse1) (= |P0Thread1of1ForFork2_#t~ite22_Out1151078418| |P0Thread1of1ForFork2_#t~ite23_Out1151078418|) .cse4 (not .cse5))) (and (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out1151078418| ~x$r_buff1_thd1~0_In1151078418) (= |P0Thread1of1ForFork2_#t~ite23_In1151078418| |P0Thread1of1ForFork2_#t~ite23_Out1151078418|) (not .cse4)) (and .cse2 (= ~x$r_buff1_thd1~0_In1151078418 |P0Thread1of1ForFork2_#t~ite23_Out1151078418|) (or .cse5 (and .cse6 .cse3) (and .cse0 .cse6)) .cse4)) (= |P0Thread1of1ForFork2_#t~ite22_In1151078418| |P0Thread1of1ForFork2_#t~ite22_Out1151078418|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1151078418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151078418, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1151078418, ~weak$$choice2~0=~weak$$choice2~0_In1151078418, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1151078418|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1151078418|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151078418} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1151078418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151078418, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1151078418, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1151078418|, ~weak$$choice2~0=~weak$$choice2~0_In1151078418, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1151078418|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1151078418|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151078418} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:36:41,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:36:41,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:36:41,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1716769271 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1716769271 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1716769271| ~x~0_In1716769271)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out1716769271| ~x$w_buff1~0_In1716769271) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1716769271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1716769271, ~x~0=~x~0_In1716769271} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1716769271|, ~x$w_buff1~0=~x$w_buff1~0_In1716769271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1716769271, ~x~0=~x~0_In1716769271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:36:41,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:36:41,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In612769013 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In612769013 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out612769013|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out612769013| ~x$w_buff0_used~0_In612769013) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In612769013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612769013} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In612769013, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out612769013|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612769013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:36:41,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2098364077 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2098364077 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-2098364077 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2098364077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-2098364077| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2098364077| ~x$w_buff1_used~0_In-2098364077) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2098364077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2098364077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2098364077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2098364077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2098364077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2098364077, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2098364077|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:36:41,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1553849493 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1553849493 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1553849493| ~x$r_buff0_thd0~0_In-1553849493)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1553849493| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1553849493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1553849493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1553849493, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1553849493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1553849493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:36:41,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In248783559 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In248783559 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In248783559 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In248783559 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out248783559| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In248783559 |ULTIMATE.start_main_#t~ite46_Out248783559|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In248783559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In248783559, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In248783559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In248783559, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out248783559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In248783559, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In248783559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:36:41,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:36:42,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:36:42 BasicIcfg [2019-12-18 22:36:42,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:36:42,092 INFO L168 Benchmark]: Toolchain (without parser) took 184846.08 ms. Allocated memory was 145.8 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 102.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,093 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.03 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.11 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,095 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,095 INFO L168 Benchmark]: RCFGBuilder took 778.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 105.8 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,096 INFO L168 Benchmark]: TraceAbstraction took 183198.25 ms. Allocated memory was 202.9 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 105.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:42,099 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.03 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.11 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 778.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 105.8 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183198.25 ms. Allocated memory was 202.9 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 105.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 182.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 49.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4129 SDtfs, 7018 SDslu, 11383 SDs, 0 SdLazy, 5042 SolverSat, 328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156231occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 112.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 213335 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 134937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...