/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:00:03,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:00:03,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:00:03,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:00:03,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:00:03,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:00:03,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:00:03,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:00:03,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:00:03,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:00:03,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:00:03,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:00:03,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:00:03,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:00:03,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:00:03,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:00:03,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:00:03,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:00:03,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:00:03,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:00:03,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:00:03,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:00:03,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:00:03,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:00:03,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:00:03,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:00:03,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:00:03,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:00:03,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:00:03,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:00:03,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:00:03,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:00:03,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:00:03,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:00:03,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:00:03,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:00:03,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:00:03,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:00:03,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:00:03,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:00:03,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:00:03,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:00:03,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:00:03,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:00:03,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:00:03,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:00:03,905 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:00:03,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:00:03,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:00:03,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:00:03,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:00:03,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:00:03,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:00:03,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:00:03,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:00:03,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:00:03,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:00:03,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:00:03,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:00:03,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:00:03,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:00:03,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:00:03,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:00:03,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:00:03,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:00:03,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:00:03,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:00:03,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:00:03,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:00:03,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:00:03,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:00:03,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:00:04,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:00:04,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:00:04,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:00:04,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:00:04,267 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:00:04,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-26 23:00:04,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd6d1dd4/11b2a1b4d11041838a15ecfe4d0a91f2/FLAGff09dbc15 [2019-12-26 23:00:04,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:00:04,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-26 23:00:04,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd6d1dd4/11b2a1b4d11041838a15ecfe4d0a91f2/FLAGff09dbc15 [2019-12-26 23:00:05,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd6d1dd4/11b2a1b4d11041838a15ecfe4d0a91f2 [2019-12-26 23:00:05,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:00:05,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:00:05,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:05,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:00:05,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:00:05,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05, skipping insertion in model container [2019-12-26 23:00:05,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:00:05,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:00:05,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:05,845 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:00:05,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:05,985 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:00:05,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05 WrapperNode [2019-12-26 23:00:05,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:05,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:05,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:00:05,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:00:05,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:06,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:00:06,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:00:06,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:00:06,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:06,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:00:06,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:00:06,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:00:06,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:00:06,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (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-26 23:00:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:00:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:00:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:00:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:00:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:00:06,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:00:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:00:06,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:00:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:00:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:00:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:00:06,213 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:00:06,922 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:00:06,923 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:00:06,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:06 BoogieIcfgContainer [2019-12-26 23:00:06,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:00:06,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:00:06,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:00:06,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:00:06,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:00:05" (1/3) ... [2019-12-26 23:00:06,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c123e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:06, skipping insertion in model container [2019-12-26 23:00:06,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (2/3) ... [2019-12-26 23:00:06,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c123e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:06, skipping insertion in model container [2019-12-26 23:00:06,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:06" (3/3) ... [2019-12-26 23:00:06,934 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-12-26 23:00:06,945 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:00:06,945 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:00:06,953 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:00:06,954 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:00:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:07,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:00:07,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:00:07,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:00:07,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:00:07,056 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:00:07,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:00:07,056 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:00:07,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:00:07,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:00:07,074 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-26 23:00:07,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:07,183 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:07,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:07,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:07,222 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:07,267 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:07,267 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:07,274 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:07,290 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 23:00:07,291 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:00:11,456 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-26 23:00:11,563 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 23:00:11,600 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-26 23:00:11,600 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-26 23:00:11,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-26 23:00:12,073 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-26 23:00:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-26 23:00:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:00:12,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:12,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:00:12,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-26 23:00:12,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:12,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808940784] [2019-12-26 23:00:12,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:12,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808940784] [2019-12-26 23:00:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:00:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481871133] [2019-12-26 23:00:12,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:12,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:12,455 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-26 23:00:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:12,731 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-26 23:00:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:12,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:00:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:12,815 INFO L225 Difference]: With dead ends: 8377 [2019-12-26 23:00:12,815 INFO L226 Difference]: Without dead ends: 8208 [2019-12-26 23:00:12,816 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-26 23:00:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-26 23:00:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-26 23:00:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-26 23:00:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-26 23:00:13,239 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-26 23:00:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:13,239 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-26 23:00:13,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-26 23:00:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:00:13,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:13,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:13,244 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-26 23:00:13,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:13,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885856251] [2019-12-26 23:00:13,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:13,443 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-26 23:00:13,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885856251] [2019-12-26 23:00:13,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:13,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:13,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85568261] [2019-12-26 23:00:13,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:13,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:13,447 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-26 23:00:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:13,493 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-26 23:00:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:13,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:00:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:13,501 INFO L225 Difference]: With dead ends: 1326 [2019-12-26 23:00:13,502 INFO L226 Difference]: Without dead ends: 1326 [2019-12-26 23:00:13,503 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-26 23:00:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-26 23:00:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-26 23:00:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-26 23:00:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-26 23:00:13,545 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-26 23:00:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:13,546 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-26 23:00:13,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-26 23:00:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:00:13,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:13,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:13,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-26 23:00:13,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:13,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802713192] [2019-12-26 23:00:13,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:13,695 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-26 23:00:13,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802713192] [2019-12-26 23:00:13,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:13,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:13,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796120566] [2019-12-26 23:00:13,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:13,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:13,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:13,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:13,698 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-26 23:00:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:14,013 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-26 23:00:14,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:00:14,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:00:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:14,029 INFO L225 Difference]: With dead ends: 1806 [2019-12-26 23:00:14,029 INFO L226 Difference]: Without dead ends: 1806 [2019-12-26 23:00:14,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-26 23:00:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-26 23:00:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-26 23:00:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-26 23:00:14,081 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-26 23:00:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:14,081 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-26 23:00:14,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-26 23:00:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 23:00:14,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:14,089 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] [2019-12-26 23:00:14,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-26 23:00:14,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:14,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086077736] [2019-12-26 23:00:14,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:14,180 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-26 23:00:14,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086077736] [2019-12-26 23:00:14,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:14,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:14,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689296240] [2019-12-26 23:00:14,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:14,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:14,182 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-26 23:00:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:14,197 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-26 23:00:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:00:14,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-26 23:00:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:14,200 INFO L225 Difference]: With dead ends: 356 [2019-12-26 23:00:14,200 INFO L226 Difference]: Without dead ends: 356 [2019-12-26 23:00:14,200 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-26 23:00:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-26 23:00:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-26 23:00:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-26 23:00:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-26 23:00:14,208 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-26 23:00:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:14,208 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-26 23:00:14,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-26 23:00:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:14,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:14,210 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] [2019-12-26 23:00:14,211 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-26 23:00:14,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:14,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821923518] [2019-12-26 23:00:14,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:14,316 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-26 23:00:14,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821923518] [2019-12-26 23:00:14,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:14,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:14,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274481861] [2019-12-26 23:00:14,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:14,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:14,319 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-26 23:00:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:14,371 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-26 23:00:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:14,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:14,373 INFO L225 Difference]: With dead ends: 331 [2019-12-26 23:00:14,373 INFO L226 Difference]: Without dead ends: 331 [2019-12-26 23:00:14,374 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-26 23:00:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-26 23:00:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-26 23:00:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-26 23:00:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-26 23:00:14,381 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-26 23:00:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:14,382 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-26 23:00:14,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-26 23:00:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:14,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:14,384 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] [2019-12-26 23:00:14,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-26 23:00:14,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:14,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542371942] [2019-12-26 23:00:14,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:14,488 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-26 23:00:14,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542371942] [2019-12-26 23:00:14,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:14,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:00:14,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33469252] [2019-12-26 23:00:14,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:14,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:14,492 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-26 23:00:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:14,715 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-26 23:00:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:00:14,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-26 23:00:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:14,719 INFO L225 Difference]: With dead ends: 458 [2019-12-26 23:00:14,720 INFO L226 Difference]: Without dead ends: 458 [2019-12-26 23:00:14,720 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-26 23:00:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-26 23:00:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-26 23:00:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-26 23:00:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-26 23:00:14,729 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-26 23:00:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:14,729 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-26 23:00:14,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-26 23:00:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:14,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:14,731 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] [2019-12-26 23:00:14,731 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-26 23:00:14,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:14,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010245030] [2019-12-26 23:00:14,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:14,855 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-26 23:00:14,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010245030] [2019-12-26 23:00:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:14,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542002655] [2019-12-26 23:00:14,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:14,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:14,857 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-26 23:00:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:15,237 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-26 23:00:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:00:15,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-26 23:00:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:15,240 INFO L225 Difference]: With dead ends: 513 [2019-12-26 23:00:15,240 INFO L226 Difference]: Without dead ends: 513 [2019-12-26 23:00:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:00:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-26 23:00:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-26 23:00:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-26 23:00:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-26 23:00:15,251 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-26 23:00:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:15,251 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-26 23:00:15,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-26 23:00:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:15,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:15,253 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] [2019-12-26 23:00:15,253 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-26 23:00:15,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:15,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963055059] [2019-12-26 23:00:15,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:15,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963055059] [2019-12-26 23:00:15,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:15,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:15,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911905892] [2019-12-26 23:00:15,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:15,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:15,385 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-26 23:00:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:15,727 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-26 23:00:15,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:00:15,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-26 23:00:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:15,732 INFO L225 Difference]: With dead ends: 694 [2019-12-26 23:00:15,733 INFO L226 Difference]: Without dead ends: 694 [2019-12-26 23:00:15,733 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-26 23:00:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-26 23:00:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-26 23:00:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-26 23:00:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-26 23:00:15,745 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-26 23:00:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:15,746 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-26 23:00:15,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-26 23:00:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:15,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:15,748 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] [2019-12-26 23:00:15,748 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-26 23:00:15,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:15,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293857456] [2019-12-26 23:00:15,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:15,817 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-26 23:00:15,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293857456] [2019-12-26 23:00:15,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:15,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:15,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766545932] [2019-12-26 23:00:15,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:15,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:15,820 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-26 23:00:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:15,839 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-26 23:00:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:15,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:15,844 INFO L225 Difference]: With dead ends: 406 [2019-12-26 23:00:15,844 INFO L226 Difference]: Without dead ends: 406 [2019-12-26 23:00:15,845 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-26 23:00:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-26 23:00:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-26 23:00:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-26 23:00:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-26 23:00:15,853 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-26 23:00:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:15,854 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-26 23:00:15,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-26 23:00:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:00:15,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:15,855 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] [2019-12-26 23:00:15,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-26 23:00:15,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:15,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566420043] [2019-12-26 23:00:15,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:15,943 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-26 23:00:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566420043] [2019-12-26 23:00:15,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:15,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:15,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957532849] [2019-12-26 23:00:15,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:15,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:15,945 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 3 states. [2019-12-26 23:00:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:15,983 INFO L93 Difference]: Finished difference Result 406 states and 738 transitions. [2019-12-26 23:00:15,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:15,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:00:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:15,986 INFO L225 Difference]: With dead ends: 406 [2019-12-26 23:00:15,986 INFO L226 Difference]: Without dead ends: 406 [2019-12-26 23:00:15,986 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-26 23:00:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-26 23:00:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 273. [2019-12-26 23:00:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-26 23:00:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 496 transitions. [2019-12-26 23:00:15,993 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 496 transitions. Word has length 53 [2019-12-26 23:00:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:15,993 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 496 transitions. [2019-12-26 23:00:15,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 496 transitions. [2019-12-26 23:00:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:15,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:15,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:15,995 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1221221950, now seen corresponding path program 1 times [2019-12-26 23:00:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244325180] [2019-12-26 23:00:15,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:16,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-26 23:00:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244325180] [2019-12-26 23:00:16,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:16,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:00:16,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860436139] [2019-12-26 23:00:16,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:16,142 INFO L87 Difference]: Start difference. First operand 273 states and 496 transitions. Second operand 6 states. [2019-12-26 23:00:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:16,212 INFO L93 Difference]: Finished difference Result 463 states and 834 transitions. [2019-12-26 23:00:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:00:16,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-26 23:00:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:16,215 INFO L225 Difference]: With dead ends: 463 [2019-12-26 23:00:16,216 INFO L226 Difference]: Without dead ends: 209 [2019-12-26 23:00:16,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:00:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-26 23:00:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-26 23:00:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-26 23:00:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 369 transitions. [2019-12-26 23:00:16,221 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 369 transitions. Word has length 54 [2019-12-26 23:00:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:16,221 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 369 transitions. [2019-12-26 23:00:16,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 369 transitions. [2019-12-26 23:00:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:16,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:16,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:16,222 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 2 times [2019-12-26 23:00:16,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:16,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719685841] [2019-12-26 23:00:16,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:16,491 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-26 23:00:16,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719685841] [2019-12-26 23:00:16,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:16,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:00:16,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845511569] [2019-12-26 23:00:16,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:00:16,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:00:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:00:16,494 INFO L87 Difference]: Start difference. First operand 209 states and 369 transitions. Second operand 13 states. [2019-12-26 23:00:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:17,001 INFO L93 Difference]: Finished difference Result 376 states and 647 transitions. [2019-12-26 23:00:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:00:17,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:00:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:17,004 INFO L225 Difference]: With dead ends: 376 [2019-12-26 23:00:17,004 INFO L226 Difference]: Without dead ends: 343 [2019-12-26 23:00:17,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:00:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-26 23:00:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-26 23:00:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-26 23:00:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 540 transitions. [2019-12-26 23:00:17,012 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 540 transitions. Word has length 54 [2019-12-26 23:00:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:17,013 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 540 transitions. [2019-12-26 23:00:17,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:00:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 540 transitions. [2019-12-26 23:00:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:17,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:17,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:17,015 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 3 times [2019-12-26 23:00:17,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:17,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93887304] [2019-12-26 23:00:17,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:17,369 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-26 23:00:17,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93887304] [2019-12-26 23:00:17,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:17,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:00:17,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560994951] [2019-12-26 23:00:17,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:00:17,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:00:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:00:17,372 INFO L87 Difference]: Start difference. First operand 309 states and 540 transitions. Second operand 13 states. [2019-12-26 23:00:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:17,797 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2019-12-26 23:00:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:00:17,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:00:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:17,800 INFO L225 Difference]: With dead ends: 414 [2019-12-26 23:00:17,800 INFO L226 Difference]: Without dead ends: 379 [2019-12-26 23:00:17,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:00:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-26 23:00:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-26 23:00:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-26 23:00:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-26 23:00:17,808 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 54 [2019-12-26 23:00:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:17,810 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-26 23:00:17,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:00:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-26 23:00:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:17,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:17,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:17,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 4 times [2019-12-26 23:00:17,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:17,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884787253] [2019-12-26 23:00:17,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:17,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:17,993 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:17,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1447~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22| 1) |v_#valid_47|) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_17|, ~x~0=v_~x~0_144, ULTIMATE.start_main_~#t1447~0.offset=|v_ULTIMATE.start_main_~#t1447~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ULTIMATE.start_main_~#t1447~0.base=|v_ULTIMATE.start_main_~#t1447~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1448~0.offset, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1448~0.base, ~x~0, ULTIMATE.start_main_~#t1447~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_~#t1447~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:00:17,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1448~0.base_10| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1448~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1448~0.offset_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10|) |v_ULTIMATE.start_main_~#t1448~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1448~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1448~0.base] because there is no mapped edge [2019-12-26 23:00:17,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:00:18,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1913502283| |P0Thread1of1ForFork0_#t~ite4_Out1913502283|)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1913502283 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1913502283 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1913502283| ~x$w_buff1~0_In1913502283)) (and .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1913502283| ~x~0_In1913502283) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1913502283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1913502283, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1913502283, ~x~0=~x~0_In1913502283} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1913502283|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1913502283|, ~x$w_buff1~0=~x$w_buff1~0_In1913502283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1913502283, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1913502283, ~x~0=~x~0_In1913502283} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:00:18,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-21520681 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-21520681 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-21520681| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-21520681| ~x$w_buff0_used~0_In-21520681) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-21520681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-21520681} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-21520681|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-21520681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-21520681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:00:18,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1469600672 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1469600672 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1469600672 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1469600672 256)))) (or (and (= ~x$w_buff1_used~0_In-1469600672 |P0Thread1of1ForFork0_#t~ite6_Out-1469600672|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1469600672|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1469600672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1469600672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1469600672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1469600672} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1469600672|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1469600672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1469600672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1469600672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1469600672} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:00:18,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1351844687 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1351844687 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1351844687|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1351844687 |P1Thread1of1ForFork1_#t~ite11_Out1351844687|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1351844687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1351844687} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1351844687|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1351844687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1351844687} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:00:18,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1676706779 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1676706779 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In1676706779 |P0Thread1of1ForFork0_#t~ite7_Out1676706779|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1676706779|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676706779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676706779} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676706779, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1676706779|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676706779} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:00:18,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2014518442 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In2014518442 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In2014518442 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2014518442 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In2014518442 |P0Thread1of1ForFork0_#t~ite8_Out2014518442|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2014518442|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2014518442, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2014518442, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2014518442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2014518442, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2014518442|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2014518442, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2014518442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:00:18,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:00:18,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-826128903 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-826128903 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-826128903 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-826128903 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-826128903 |P1Thread1of1ForFork1_#t~ite12_Out-826128903|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-826128903|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-826128903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-826128903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-826128903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-826128903} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-826128903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-826128903, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-826128903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-826128903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-826128903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:00:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-203709793 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-203709793 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-203709793 0)) (and (= ~x$r_buff0_thd2~0_Out-203709793 ~x$r_buff0_thd2~0_In-203709793) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-203709793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-203709793|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-203709793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203709793} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:00:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-253737444 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-253737444 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-253737444 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-253737444 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-253737444| ~x$r_buff1_thd2~0_In-253737444) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-253737444|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-253737444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-253737444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-253737444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253737444} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-253737444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-253737444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-253737444, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-253737444|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253737444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:00:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:00:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:00:18,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In209625130 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In209625130 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out209625130| |ULTIMATE.start_main_#t~ite17_Out209625130|))) (or (and .cse0 (= ~x$w_buff1~0_In209625130 |ULTIMATE.start_main_#t~ite17_Out209625130|) (not .cse1) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~x~0_In209625130 |ULTIMATE.start_main_#t~ite17_Out209625130|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In209625130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In209625130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In209625130, ~x~0=~x~0_In209625130} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out209625130|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out209625130|, ~x$w_buff1~0=~x$w_buff1~0_In209625130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In209625130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In209625130, ~x~0=~x~0_In209625130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-26 23:00:18,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-554461222 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-554461222 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-554461222|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-554461222 |ULTIMATE.start_main_#t~ite19_Out-554461222|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-554461222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-554461222, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-554461222|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-554461222} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:00:18,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In295671273 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In295671273 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In295671273 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In295671273 256)))) (or (and (= ~x$w_buff1_used~0_In295671273 |ULTIMATE.start_main_#t~ite20_Out295671273|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite20_Out295671273|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In295671273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In295671273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In295671273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out295671273|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In295671273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:00:18,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1259087123 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1259087123 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1259087123 |ULTIMATE.start_main_#t~ite21_Out-1259087123|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1259087123|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1259087123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1259087123, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1259087123|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1259087123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:00:18,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-523381632 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-523381632 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-523381632 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-523381632 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-523381632|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-523381632 |ULTIMATE.start_main_#t~ite22_Out-523381632|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-523381632, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-523381632, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-523381632, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-523381632} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-523381632, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-523381632, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-523381632, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-523381632|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-523381632} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:00:18,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1936516216 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-1936516216| |ULTIMATE.start_main_#t~ite31_Out-1936516216|) (= |ULTIMATE.start_main_#t~ite31_Out-1936516216| ~x$w_buff1~0_In-1936516216) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1936516216 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-1936516216 256)) .cse0) (and (= (mod ~x$w_buff1_used~0_In-1936516216 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1936516216 256)))) .cse1) (and (= |ULTIMATE.start_main_#t~ite31_In-1936516216| |ULTIMATE.start_main_#t~ite31_Out-1936516216|) (not .cse1) (= |ULTIMATE.start_main_#t~ite32_Out-1936516216| ~x$w_buff1~0_In-1936516216)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1936516216, ~x$w_buff1~0=~x$w_buff1~0_In-1936516216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936516216, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1936516216, ~weak$$choice2~0=~weak$$choice2~0_In-1936516216, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1936516216|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936516216} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1936516216, ~x$w_buff1~0=~x$w_buff1~0_In-1936516216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936516216, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1936516216|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1936516216, ~weak$$choice2~0=~weak$$choice2~0_In-1936516216, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1936516216|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936516216} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-26 23:00:18,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 23:00:18,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:00:18,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:00:18,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:18 BasicIcfg [2019-12-26 23:00:18,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:18,109 INFO L168 Benchmark]: Toolchain (without parser) took 12954.71 ms. Allocated memory was 138.9 MB in the beginning and 378.5 MB in the end (delta: 239.6 MB). Free memory was 103.0 MB in the beginning and 104.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 237.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,113 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.19 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.6 MB in the beginning and 158.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.79 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,116 INFO L168 Benchmark]: Boogie Preprocessor took 55.44 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,117 INFO L168 Benchmark]: RCFGBuilder took 794.94 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,117 INFO L168 Benchmark]: TraceAbstraction took 11177.58 ms. Allocated memory was 203.9 MB in the beginning and 378.5 MB in the end (delta: 174.6 MB). Free memory was 107.9 MB in the beginning and 104.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:18,122 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.54 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.19 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.6 MB in the beginning and 158.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.79 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.44 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.94 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11177.58 ms. Allocated memory was 203.9 MB in the beginning and 378.5 MB in the end (delta: 174.6 MB). Free memory was 107.9 MB in the beginning and 104.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1280 SDtfs, 1127 SDslu, 2786 SDs, 0 SdLazy, 1523 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 860 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 86443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...