/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/mix044_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:34:34,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:34:34,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:34:34,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:34:34,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:34:34,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:34:34,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:34:34,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:34:34,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:34:34,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:34:34,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:34:34,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:34:34,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:34:34,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:34:34,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:34:34,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:34:34,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:34:34,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:34:34,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:34:34,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:34:34,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:34:34,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:34:34,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:34:34,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:34:34,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:34:34,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:34:34,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:34:34,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:34:34,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:34:34,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:34:34,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:34:34,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:34:34,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:34:34,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:34:34,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:34:34,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:34:34,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:34:34,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:34:34,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:34:34,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:34:34,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:34:34,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:34:34,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:34:34,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:34:34,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:34:34,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:34:34,996 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:34:34,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:34:34,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:34:34,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:34:34,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:34:34,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:34:34,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:34:34,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:34:34,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:34:34,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:34:34,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:34:34,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:34:34,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:34:34,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:34:34,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:34:34,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:34:34,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:34:34,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:34:34,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:34:35,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:34:35,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:34:35,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:34:35,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:34:35,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:34:35,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:34:35,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:34:35,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:34:35,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:34:35,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:34:35,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:34:35,284 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:34:35,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-27 06:34:35,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf705795/032fae50fe21417ebf764dd4711d27eb/FLAGb19ea7aca [2019-12-27 06:34:35,897 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:34:35,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-27 06:34:35,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf705795/032fae50fe21417ebf764dd4711d27eb/FLAGb19ea7aca [2019-12-27 06:34:36,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf705795/032fae50fe21417ebf764dd4711d27eb [2019-12-27 06:34:36,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:34:36,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:34:36,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:34:36,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:34:36,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:34:36,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:34:36" (1/1) ... [2019-12-27 06:34:36,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:36, skipping insertion in model container [2019-12-27 06:34:36,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:34:36" (1/1) ... [2019-12-27 06:34:36,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:34:36,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:34:36,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:34:36,870 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:34:36,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:34:37,067 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:34:37,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37 WrapperNode [2019-12-27 06:34:37,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:34:37,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:34:37,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:34:37,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:34:37,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:34:37,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:34:37,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:34:37,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:34:37,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (1/1) ... [2019-12-27 06:34:37,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:34:37,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:34:37,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:34:37,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:34:37,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34: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-27 06:34:37,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:34:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:34:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:34:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:34:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:34:37,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:34:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:34:37,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:34:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:34:37,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:34:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:34:37,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:34:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:34:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:34:37,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:34:37,256 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:34:38,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:34:38,090 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:34:38,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:34:38 BoogieIcfgContainer [2019-12-27 06:34:38,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:34:38,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:34:38,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:34:38,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:34:38,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:34:36" (1/3) ... [2019-12-27 06:34:38,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529c5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:34:38, skipping insertion in model container [2019-12-27 06:34:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:34:37" (2/3) ... [2019-12-27 06:34:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529c5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:34:38, skipping insertion in model container [2019-12-27 06:34:38,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:34:38" (3/3) ... [2019-12-27 06:34:38,101 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_tso.opt.i [2019-12-27 06:34:38,112 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:34:38,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:34:38,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:34:38,132 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:34:38,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,187 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,187 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,206 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,206 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,206 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,248 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,248 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:34:38,266 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:34:38,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:34:38,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:34:38,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:34:38,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:34:38,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:34:38,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:34:38,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:34:38,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:34:38,306 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 06:34:38,308 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:34:38,418 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:34:38,419 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:34:38,436 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:34:38,451 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:34:38,539 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:34:38,540 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:34:38,551 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:34:38,571 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:34:38,573 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:34:42,284 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:34:42,423 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:34:42,454 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 06:34:42,454 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:34:42,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 06:34:45,800 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 06:34:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 06:34:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:34:45,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:45,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:45,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 06:34:45,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300991811] [2019-12-27 06:34:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:46,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300991811] [2019-12-27 06:34:46,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:46,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:34:46,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447518787] [2019-12-27 06:34:46,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:34:46,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:34:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:46,177 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 06:34:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:46,898 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 06:34:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:34:46,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:34:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:47,437 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 06:34:47,437 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 06:34:47,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 06:34:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 06:34:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 06:34:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 06:34:49,191 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 06:34:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:49,192 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 06:34:49,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:34:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 06:34:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:34:49,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:49,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:49,201 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 06:34:49,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:49,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724999023] [2019-12-27 06:34:49,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:49,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724999023] [2019-12-27 06:34:49,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:49,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:34:49,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207012830] [2019-12-27 06:34:49,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:34:49,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:34:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:34:49,293 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-27 06:34:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:51,341 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 06:34:51,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:34:51,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:34:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:51,580 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 06:34:51,581 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 06:34:51,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:34:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 06:34:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 06:34:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 06:34:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 06:34:53,883 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 06:34:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:53,883 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 06:34:53,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:34:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 06:34:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:34:53,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:53,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:53,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 06:34:53,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:53,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397439439] [2019-12-27 06:34:53,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:53,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397439439] [2019-12-27 06:34:53,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:53,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:34:53,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336948465] [2019-12-27 06:34:53,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:34:53,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:34:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:53,970 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 06:34:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:54,136 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 06:34:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:34:54,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:34:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:54,255 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 06:34:54,256 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 06:34:54,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 06:34:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 06:34:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 06:34:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 06:34:57,673 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 06:34:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:57,673 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 06:34:57,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:34:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 06:34:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:34:57,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:57,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:57,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 06:34:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:57,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160154607] [2019-12-27 06:34:57,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:57,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160154607] [2019-12-27 06:34:57,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:57,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:34:57,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933535531] [2019-12-27 06:34:57,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:34:57,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:34:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:34:57,751 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 06:34:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:57,825 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 06:34:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:34:57,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:34:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:57,850 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 06:34:57,850 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 06:34:57,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:34:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 06:34:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 06:34:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 06:34:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 06:34:58,170 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 06:34:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:58,171 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 06:34:58,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:34:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 06:34:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:34:58,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:58,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:58,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 06:34:58,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:58,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420306591] [2019-12-27 06:34:58,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:58,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420306591] [2019-12-27 06:34:58,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:58,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:34:58,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616755597] [2019-12-27 06:34:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:34:58,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:34:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:34:58,228 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-27 06:34:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:58,266 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 06:34:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:34:58,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:34:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:58,271 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 06:34:58,271 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 06:34:58,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:34:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 06:34:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 06:34:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 06:34:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 06:34:58,309 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 06:34:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:58,310 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 06:34:58,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:34:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 06:34:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:34:58,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:58,314 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] [2019-12-27 06:34:58,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 06:34:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:58,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792993706] [2019-12-27 06:34:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:58,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792993706] [2019-12-27 06:34:58,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:58,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:34:58,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304056708] [2019-12-27 06:34:58,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:34:58,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:34:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:34:58,389 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-27 06:34:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:58,445 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 06:34:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:34:58,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 06:34:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:58,448 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 06:34:58,448 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 06:34:58,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:34:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 06:34:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 06:34:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 06:34:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 06:34:58,468 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 06:34:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:58,468 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 06:34:58,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:34:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 06:34:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:34:58,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:58,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:58,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 06:34:58,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:58,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089885505] [2019-12-27 06:34:58,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:58,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089885505] [2019-12-27 06:34:58,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:58,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:34:58,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182133522] [2019-12-27 06:34:58,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:34:58,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:34:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:58,606 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 06:34:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:58,650 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 06:34:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:34:58,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:34:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:58,654 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 06:34:58,654 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 06:34:58,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:34:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 06:34:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 06:34:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 06:34:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 06:34:58,677 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 06:34:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:58,678 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 06:34:58,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:34:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 06:34:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:34:58,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:58,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:58,682 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 06:34:58,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:58,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596262880] [2019-12-27 06:34:58,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:58,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596262880] [2019-12-27 06:34:58,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:58,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:34:58,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931740182] [2019-12-27 06:34:58,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:34:58,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:34:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:34:58,791 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 06:34:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:34:59,518 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 06:34:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:34:59,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:34:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:34:59,523 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 06:34:59,523 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 06:34:59,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:34:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 06:34:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 06:34:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 06:34:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 06:34:59,542 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 06:34:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:34:59,542 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 06:34:59,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:34:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 06:34:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:34:59,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:34:59,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:34:59,546 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:34:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:34:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 06:34:59,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:34:59,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314599754] [2019-12-27 06:34:59,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:34:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:34:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:34:59,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314599754] [2019-12-27 06:34:59,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:34:59,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:34:59,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621146979] [2019-12-27 06:34:59,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:34:59,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:34:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:34:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:34:59,655 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-27 06:35:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:00,058 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-27 06:35:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:35:00,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:35:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:00,063 INFO L225 Difference]: With dead ends: 2369 [2019-12-27 06:35:00,064 INFO L226 Difference]: Without dead ends: 2369 [2019-12-27 06:35:00,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:35:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-27 06:35:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-27 06:35:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 06:35:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 06:35:00,093 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 06:35:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:00,094 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 06:35:00,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:35:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 06:35:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:35:00,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:00,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:00,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 06:35:00,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:00,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26567908] [2019-12-27 06:35:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:00,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26567908] [2019-12-27 06:35:00,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:00,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:35:00,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068600179] [2019-12-27 06:35:00,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:35:00,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:35:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:35:00,208 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 06:35:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:00,585 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 06:35:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:35:00,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:35:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:00,592 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 06:35:00,592 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 06:35:00,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:35:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 06:35:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 06:35:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 06:35:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 06:35:00,618 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 06:35:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:00,618 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 06:35:00,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:35:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 06:35:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:35:00,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:00,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:00,622 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 06:35:00,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:00,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516020950] [2019-12-27 06:35:00,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:00,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516020950] [2019-12-27 06:35:00,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:00,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:35:00,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306072137] [2019-12-27 06:35:00,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:35:00,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:35:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:35:00,752 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 7 states. [2019-12-27 06:35:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:01,200 INFO L93 Difference]: Finished difference Result 2633 states and 7491 transitions. [2019-12-27 06:35:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:35:01,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:35:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:01,206 INFO L225 Difference]: With dead ends: 2633 [2019-12-27 06:35:01,206 INFO L226 Difference]: Without dead ends: 2633 [2019-12-27 06:35:01,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:35:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2019-12-27 06:35:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 1606. [2019-12-27 06:35:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 06:35:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4617 transitions. [2019-12-27 06:35:01,229 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 4617 transitions. Word has length 58 [2019-12-27 06:35:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:01,229 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 4617 transitions. [2019-12-27 06:35:01,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:35:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 4617 transitions. [2019-12-27 06:35:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:35:01,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:01,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:01,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-27 06:35:01,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:01,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029947940] [2019-12-27 06:35:01,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:01,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029947940] [2019-12-27 06:35:01,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:01,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:35:01,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728933206] [2019-12-27 06:35:01,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:35:01,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:35:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:35:01,577 INFO L87 Difference]: Start difference. First operand 1606 states and 4617 transitions. Second operand 12 states. [2019-12-27 06:35:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:02,745 INFO L93 Difference]: Finished difference Result 4021 states and 10616 transitions. [2019-12-27 06:35:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:35:02,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 06:35:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:02,750 INFO L225 Difference]: With dead ends: 4021 [2019-12-27 06:35:02,750 INFO L226 Difference]: Without dead ends: 2298 [2019-12-27 06:35:02,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 06:35:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2019-12-27 06:35:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1476. [2019-12-27 06:35:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-27 06:35:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-27 06:35:02,783 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 59 [2019-12-27 06:35:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:02,784 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-27 06:35:02,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:35:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-27 06:35:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:35:02,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:02,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:02,788 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 2 times [2019-12-27 06:35:02,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:02,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470956541] [2019-12-27 06:35:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:02,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470956541] [2019-12-27 06:35:02,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:02,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:02,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49942761] [2019-12-27 06:35:02,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:02,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:02,919 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 3 states. [2019-12-27 06:35:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:02,969 INFO L93 Difference]: Finished difference Result 1475 states and 4175 transitions. [2019-12-27 06:35:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:02,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:35:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:02,972 INFO L225 Difference]: With dead ends: 1475 [2019-12-27 06:35:02,972 INFO L226 Difference]: Without dead ends: 1475 [2019-12-27 06:35:02,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-27 06:35:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 950. [2019-12-27 06:35:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 06:35:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-27 06:35:03,024 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 59 [2019-12-27 06:35:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:03,024 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-27 06:35:03,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-27 06:35:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:35:03,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:03,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:03,027 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 1 times [2019-12-27 06:35:03,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:03,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071005847] [2019-12-27 06:35:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:03,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071005847] [2019-12-27 06:35:03,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:03,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:03,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691120335] [2019-12-27 06:35:03,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:03,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:03,102 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 3 states. [2019-12-27 06:35:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:03,117 INFO L93 Difference]: Finished difference Result 894 states and 2465 transitions. [2019-12-27 06:35:03,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:03,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:35:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:03,119 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:35:03,120 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:35:03,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:35:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 830. [2019-12-27 06:35:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 06:35:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2281 transitions. [2019-12-27 06:35:03,137 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2281 transitions. Word has length 59 [2019-12-27 06:35:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:03,137 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 2281 transitions. [2019-12-27 06:35:03,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2281 transitions. [2019-12-27 06:35:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:35:03,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:03,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:03,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash -40355053, now seen corresponding path program 1 times [2019-12-27 06:35:03,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:03,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403332983] [2019-12-27 06:35:03,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:03,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403332983] [2019-12-27 06:35:03,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:03,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:35:03,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253424357] [2019-12-27 06:35:03,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:35:03,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:35:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:35:03,262 INFO L87 Difference]: Start difference. First operand 830 states and 2281 transitions. Second operand 5 states. [2019-12-27 06:35:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:03,301 INFO L93 Difference]: Finished difference Result 1039 states and 2657 transitions. [2019-12-27 06:35:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:35:03,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 06:35:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:03,303 INFO L225 Difference]: With dead ends: 1039 [2019-12-27 06:35:03,303 INFO L226 Difference]: Without dead ends: 604 [2019-12-27 06:35:03,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:35:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-27 06:35:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-12-27 06:35:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:35:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-27 06:35:03,315 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 60 [2019-12-27 06:35:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:03,315 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-27 06:35:03,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:35:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-27 06:35:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:35:03,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:03,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:03,317 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 2 times [2019-12-27 06:35:03,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:03,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939715842] [2019-12-27 06:35:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:03,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939715842] [2019-12-27 06:35:03,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:03,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:35:03,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762070527] [2019-12-27 06:35:03,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:35:03,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:03,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:35:03,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:35:03,495 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 7 states. [2019-12-27 06:35:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:03,658 INFO L93 Difference]: Finished difference Result 993 states and 2351 transitions. [2019-12-27 06:35:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:35:03,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 06:35:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:03,660 INFO L225 Difference]: With dead ends: 993 [2019-12-27 06:35:03,660 INFO L226 Difference]: Without dead ends: 268 [2019-12-27 06:35:03,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:35:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-27 06:35:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2019-12-27 06:35:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 06:35:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 06:35:03,664 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-27 06:35:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:03,665 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 06:35:03,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:35:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 06:35:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:35:03,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:03,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:03,666 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 3 times [2019-12-27 06:35:03,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:03,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101171347] [2019-12-27 06:35:03,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:03,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101171347] [2019-12-27 06:35:03,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:03,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:35:04,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671406891] [2019-12-27 06:35:04,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:35:04,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:35:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:35:04,002 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 15 states. [2019-12-27 06:35:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:04,657 INFO L93 Difference]: Finished difference Result 409 states and 709 transitions. [2019-12-27 06:35:04,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:35:04,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 06:35:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:04,658 INFO L225 Difference]: With dead ends: 409 [2019-12-27 06:35:04,659 INFO L226 Difference]: Without dead ends: 378 [2019-12-27 06:35:04,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:35:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-27 06:35:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 336. [2019-12-27 06:35:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 06:35:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 590 transitions. [2019-12-27 06:35:04,664 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 590 transitions. Word has length 60 [2019-12-27 06:35:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:04,665 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 590 transitions. [2019-12-27 06:35:04,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:35:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 590 transitions. [2019-12-27 06:35:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:35:04,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:04,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:04,666 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1131398243, now seen corresponding path program 4 times [2019-12-27 06:35:04,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:04,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302070261] [2019-12-27 06:35:04,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:04,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302070261] [2019-12-27 06:35:04,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:04,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:35:04,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914359855] [2019-12-27 06:35:04,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:35:04,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:35:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:35:04,956 INFO L87 Difference]: Start difference. First operand 336 states and 590 transitions. Second operand 14 states. [2019-12-27 06:35:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:05,561 INFO L93 Difference]: Finished difference Result 445 states and 760 transitions. [2019-12-27 06:35:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:35:05,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:35:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:05,563 INFO L225 Difference]: With dead ends: 445 [2019-12-27 06:35:05,563 INFO L226 Difference]: Without dead ends: 414 [2019-12-27 06:35:05,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:35:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-27 06:35:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 344. [2019-12-27 06:35:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 06:35:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 06:35:05,569 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 06:35:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:05,569 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 06:35:05,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:35:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 06:35:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:35:05,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:05,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:05,570 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 5 times [2019-12-27 06:35:05,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:05,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243766047] [2019-12-27 06:35:05,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:35:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:35:05,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:35:05,689 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:35:05,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1189~0.base_19| 4) |v_#length_29|) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1189~0.base_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19|) 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 |v_#NULL.base_7|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19|) |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z~0_27 0) (= |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19| 1) |v_#valid_70|) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_21|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_~#t1189~0.offset=|v_ULTIMATE.start_main_~#t1189~0.offset_16|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t1189~0.base=|v_ULTIMATE.start_main_~#t1189~0.base_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_22|, ~b~0=v_~b~0_11, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1191~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1192~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1192~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1189~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1191~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1189~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1190~0.base, ~b~0, ULTIMATE.start_main_~#t1190~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:35:05,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13| 1) |v_#valid_48|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13|) |v_ULTIMATE.start_main_~#t1190~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1190~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1190~0.base_13|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1190~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1190~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_13|, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1190~0.base, ULTIMATE.start_main_~#t1190~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:35:05,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1191~0.offset_10|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1191~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1191~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1191~0.base_12| 0)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12|) |v_ULTIMATE.start_main_~#t1191~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1191~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1191~0.base, #length] because there is no mapped edge [2019-12-27 06:35:05,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1192~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1192~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1192~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12|) |v_ULTIMATE.start_main_~#t1192~0.offset_10| 3)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1192~0.base, ULTIMATE.start_main_~#t1192~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:35:05,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:35:05,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:35:05,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:35:05,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1649887059 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1649887059 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1649887059| ~z$w_buff0_used~0_In-1649887059)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1649887059|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649887059, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1649887059} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649887059, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1649887059, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1649887059|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:35:05,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2089003837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2089003837 256)))) (or (and (= ~z$w_buff1~0_In2089003837 |P2Thread1of1ForFork2_#t~ite3_Out2089003837|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In2089003837 |P2Thread1of1ForFork2_#t~ite3_Out2089003837|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2089003837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2089003837, ~z$w_buff1~0=~z$w_buff1~0_In2089003837, ~z~0=~z~0_In2089003837} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2089003837|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2089003837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2089003837, ~z$w_buff1~0=~z$w_buff1~0_In2089003837, ~z~0=~z~0_In2089003837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:35:05,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-550471011 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-550471011 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-550471011 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-550471011 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-550471011| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork3_#t~ite12_Out-550471011| ~z$w_buff1_used~0_In-550471011) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-550471011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550471011, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-550471011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550471011} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-550471011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550471011, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-550471011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550471011, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-550471011|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:35:05,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1323152144 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1323152144 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-1323152144 ~z$r_buff0_thd4~0_In-1323152144) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd4~0_Out-1323152144 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323152144, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1323152144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323152144, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1323152144, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1323152144|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:35:05,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-1433148230 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1433148230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1433148230 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1433148230 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1433148230|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1433148230 |P3Thread1of1ForFork3_#t~ite14_Out-1433148230|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1433148230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433148230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433148230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433148230} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1433148230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433148230, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1433148230|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433148230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433148230} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:35:05,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:35:05,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:35:05,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1948219065 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1948219065 256) 0))) (or (and (= ~z$w_buff0_used~0_In1948219065 |P2Thread1of1ForFork2_#t~ite5_Out1948219065|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1948219065|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1948219065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1948219065} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1948219065|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1948219065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1948219065} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:35:05,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1728433083 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1728433083 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1728433083 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1728433083 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1728433083| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out1728433083| ~z$w_buff1_used~0_In1728433083) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1728433083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1728433083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1728433083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1728433083} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1728433083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1728433083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1728433083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1728433083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1728433083} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:35:05,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1284993307 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1284993307 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1284993307| ~z$r_buff0_thd3~0_In-1284993307)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1284993307| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284993307, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284993307} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284993307, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284993307, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1284993307|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:35:05,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-424629269 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-424629269 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-424629269 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-424629269 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-424629269| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-424629269 |P2Thread1of1ForFork2_#t~ite8_Out-424629269|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-424629269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-424629269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-424629269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-424629269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-424629269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-424629269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-424629269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-424629269, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-424629269|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:35:05,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:35:05,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 06:35:05,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-583548820 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-583548820 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-583548820 |ULTIMATE.start_main_#t~ite19_Out-583548820|)) (and (not .cse0) (= ~z$w_buff1~0_In-583548820 |ULTIMATE.start_main_#t~ite19_Out-583548820|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-583548820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-583548820, ~z$w_buff1~0=~z$w_buff1~0_In-583548820, ~z~0=~z~0_In-583548820} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-583548820|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-583548820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-583548820, ~z$w_buff1~0=~z$w_buff1~0_In-583548820, ~z~0=~z~0_In-583548820} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:35:05,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:35:05,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1240948582 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1240948582 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1240948582| ~z$w_buff0_used~0_In-1240948582)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1240948582| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1240948582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240948582} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1240948582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240948582, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1240948582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:35:05,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2052843672 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2052843672 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2052843672 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2052843672 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2052843672|)) (and (= ~z$w_buff1_used~0_In-2052843672 |ULTIMATE.start_main_#t~ite22_Out-2052843672|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2052843672, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2052843672, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2052843672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2052843672} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2052843672, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2052843672, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2052843672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2052843672, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2052843672|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:35:05,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-798976330 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-798976330 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-798976330| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out-798976330| ~z$r_buff0_thd0~0_In-798976330) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798976330, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798976330} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798976330, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798976330, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-798976330|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:35:05,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In862666443 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In862666443 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In862666443 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In862666443 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out862666443|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In862666443 |ULTIMATE.start_main_#t~ite24_Out862666443|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In862666443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In862666443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In862666443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862666443} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In862666443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In862666443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In862666443, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out862666443|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862666443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:35:05,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1604566497 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1604566497| |ULTIMATE.start_main_#t~ite39_Out-1604566497|) (= |ULTIMATE.start_main_#t~ite40_Out-1604566497| ~z$w_buff1_used~0_In-1604566497)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1604566497| ~z$w_buff1_used~0_In-1604566497) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1604566497 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1604566497 256) 0)) (= (mod ~z$w_buff0_used~0_In-1604566497 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1604566497 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1604566497| |ULTIMATE.start_main_#t~ite40_Out-1604566497|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604566497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604566497, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1604566497|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1604566497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604566497, ~weak$$choice2~0=~weak$$choice2~0_In-1604566497} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604566497, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1604566497|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1604566497|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604566497, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1604566497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604566497, ~weak$$choice2~0=~weak$$choice2~0_In-1604566497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:35:05,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:35:05,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse4 (= (mod ~z$w_buff1_used~0_In167464084 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In167464084 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In167464084 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In167464084 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out167464084| |ULTIMATE.start_main_#t~ite45_Out167464084|)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In167464084 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_In167464084| |ULTIMATE.start_main_#t~ite44_Out167464084|) (or (and (not .cse0) (= ~z$r_buff1_thd0~0_In167464084 |ULTIMATE.start_main_#t~ite46_Out167464084|) (= |ULTIMATE.start_main_#t~ite45_Out167464084| |ULTIMATE.start_main_#t~ite45_In167464084|)) (and (= ~z$r_buff1_thd0~0_In167464084 |ULTIMATE.start_main_#t~ite45_Out167464084|) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (= |ULTIMATE.start_main_#t~ite45_Out167464084| |ULTIMATE.start_main_#t~ite44_Out167464084|) (= 0 |ULTIMATE.start_main_#t~ite44_Out167464084|) .cse0 (not .cse1) (or .cse6 (not .cse3)) .cse5)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In167464084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In167464084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In167464084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167464084, ~weak$$choice2~0=~weak$$choice2~0_In167464084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In167464084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In167464084|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In167464084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In167464084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In167464084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167464084, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out167464084|, ~weak$$choice2~0=~weak$$choice2~0_In167464084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out167464084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out167464084|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:35:05,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:35:05,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:35:05,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:35:05 BasicIcfg [2019-12-27 06:35:05,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:35:05,844 INFO L168 Benchmark]: Toolchain (without parser) took 29638.96 ms. Allocated memory was 144.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 98.8 MB in the beginning and 703.2 MB in the end (delta: -604.4 MB). Peak memory consumption was 548.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,845 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.86 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.4 MB in the beginning and 154.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.56 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,847 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,847 INFO L168 Benchmark]: RCFGBuilder took 905.04 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 99.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,848 INFO L168 Benchmark]: TraceAbstraction took 27749.69 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 98.7 MB in the beginning and 703.2 MB in the end (delta: -604.5 MB). Peak memory consumption was 491.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:05,852 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 860.86 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.4 MB in the beginning and 154.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.56 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 905.04 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 99.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27749.69 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 98.7 MB in the beginning and 703.2 MB in the end (delta: -604.5 MB). Peak memory consumption was 491.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2023 SDtfs, 2447 SDslu, 5349 SDs, 0 SdLazy, 2856 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 36 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 10662 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 183015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...