/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:42:33,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:42:33,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:42:33,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:42:33,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:42:33,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:42:33,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:42:33,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:42:33,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:42:33,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:42:33,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:42:33,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:42:33,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:42:33,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:42:33,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:42:33,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:42:33,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:42:33,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:42:33,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:42:33,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:42:33,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:42:33,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:42:33,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:42:33,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:42:33,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:42:33,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:42:33,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:42:33,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:42:33,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:42:33,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:42:33,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:42:33,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:42:33,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:42:33,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:42:33,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:42:33,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:42:33,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:42:33,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:42:33,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:42:33,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:42:33,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:42:33,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:42:33,951 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:42:33,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:42:33,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:42:33,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:42:33,953 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:42:33,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:42:33,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:42:33,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:42:33,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:42:33,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:42:33,955 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:42:33,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:42:33,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:42:33,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:42:33,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:42:33,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:42:33,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:42:33,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:42:33,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:42:33,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:42:33,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:42:33,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:42:33,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:42:33,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:42:34,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:42:34,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:42:34,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:42:34,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:42:34,268 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:42:34,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-18 18:42:34,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3249b63e/58ea82b474c4441ab76012ce95f3c320/FLAG1041ee820 [2019-12-18 18:42:34,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:42:34,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-18 18:42:34,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3249b63e/58ea82b474c4441ab76012ce95f3c320/FLAG1041ee820 [2019-12-18 18:42:35,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3249b63e/58ea82b474c4441ab76012ce95f3c320 [2019-12-18 18:42:35,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:42:35,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:42:35,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:42:35,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:42:35,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:42:35,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:42:35" (1/1) ... [2019-12-18 18:42:35,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc86dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:35, skipping insertion in model container [2019-12-18 18:42:35,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:42:35" (1/1) ... [2019-12-18 18:42:35,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:42:35,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:42:35,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:42:35,816 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:42:35,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:42:36,050 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:42:36,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36 WrapperNode [2019-12-18 18:42:36,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:42:36,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:42:36,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:42:36,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:42:36,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:42:36,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:42:36,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:42:36,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:42:36,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... [2019-12-18 18:42:36,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:42:36,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:42:36,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:42:36,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:42:36,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:42:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:42:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:42:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:42:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:42:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:42:36,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:42:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:42:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:42:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:42:36,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:42:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:42:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:42:36,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:42:36,332 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:42:37,172 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:42:37,172 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:42:37,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:42:37 BoogieIcfgContainer [2019-12-18 18:42:37,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:42:37,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:42:37,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:42:37,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:42:37,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:42:35" (1/3) ... [2019-12-18 18:42:37,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f908e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:42:37, skipping insertion in model container [2019-12-18 18:42:37,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:42:36" (2/3) ... [2019-12-18 18:42:37,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f908e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:42:37, skipping insertion in model container [2019-12-18 18:42:37,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:42:37" (3/3) ... [2019-12-18 18:42:37,187 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2019-12-18 18:42:37,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:42:37,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:42:37,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:42:37,212 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:42:37,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,297 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,297 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:42:37,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:42:37,348 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:42:37,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:42:37,349 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:42:37,349 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:42:37,349 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:42:37,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:42:37,349 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:42:37,349 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:42:37,366 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 18:42:37,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 18:42:37,454 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 18:42:37,454 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:42:37,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:42:37,499 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 18:42:37,545 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 18:42:37,545 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:42:37,553 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:42:37,573 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 18:42:37,574 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:42:42,887 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:42:43,001 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:42:43,030 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-18 18:42:43,030 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 18:42:43,035 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 18:42:59,236 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-18 18:42:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-18 18:42:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:42:59,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:42:59,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:42:59,245 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:42:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:42:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-18 18:42:59,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:42:59,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758729556] [2019-12-18 18:42:59,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:42:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:42:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:42:59,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758729556] [2019-12-18 18:42:59,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:42:59,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:42:59,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468021304] [2019-12-18 18:42:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:42:59,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:42:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:42:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:42:59,506 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-18 18:43:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:03,206 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-18 18:43:03,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:03,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:43:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:03,947 INFO L225 Difference]: With dead ends: 112536 [2019-12-18 18:43:03,947 INFO L226 Difference]: Without dead ends: 110184 [2019-12-18 18:43:03,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-18 18:43:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-18 18:43:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-18 18:43:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-18 18:43:15,574 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-18 18:43:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:15,575 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-18 18:43:15,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-18 18:43:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:43:15,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:15,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:15,586 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-18 18:43:15,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:15,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131774489] [2019-12-18 18:43:15,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:15,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131774489] [2019-12-18 18:43:15,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:15,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:15,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161888373] [2019-12-18 18:43:15,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:43:15,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:43:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:43:15,741 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-18 18:43:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:16,923 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-18 18:43:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:43:16,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:43:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:22,433 INFO L225 Difference]: With dead ends: 172298 [2019-12-18 18:43:22,433 INFO L226 Difference]: Without dead ends: 172249 [2019-12-18 18:43:22,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-18 18:43:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-18 18:43:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-18 18:43:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-18 18:43:37,805 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-18 18:43:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:37,805 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-18 18:43:37,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:43:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-18 18:43:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:43:37,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:37,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:37,810 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-18 18:43:37,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:37,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060561132] [2019-12-18 18:43:37,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:37,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060561132] [2019-12-18 18:43:37,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:37,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:37,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507072129] [2019-12-18 18:43:37,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:43:37,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:37,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:43:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:37,878 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-18 18:43:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:37,994 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-18 18:43:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:37,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:43:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:38,056 INFO L225 Difference]: With dead ends: 32129 [2019-12-18 18:43:38,056 INFO L226 Difference]: Without dead ends: 32129 [2019-12-18 18:43:38,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-18 18:43:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-18 18:43:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-18 18:43:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-18 18:43:38,634 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-18 18:43:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:38,635 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-18 18:43:38,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-18 18:43:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:43:38,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:38,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:38,637 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-18 18:43:38,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:38,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075222824] [2019-12-18 18:43:38,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:38,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075222824] [2019-12-18 18:43:38,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:38,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:38,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371202112] [2019-12-18 18:43:38,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:43:38,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:38,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:43:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:43:38,745 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-18 18:43:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:39,183 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-18 18:43:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:43:39,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:43:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:39,244 INFO L225 Difference]: With dead ends: 43159 [2019-12-18 18:43:39,244 INFO L226 Difference]: Without dead ends: 43152 [2019-12-18 18:43:39,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-18 18:43:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-18 18:43:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-18 18:43:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-18 18:43:40,911 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-18 18:43:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:40,911 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-18 18:43:40,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:43:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-18 18:43:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:43:40,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:40,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:40,916 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-18 18:43:40,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:40,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842239134] [2019-12-18 18:43:40,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:41,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842239134] [2019-12-18 18:43:41,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:41,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:43:41,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419898250] [2019-12-18 18:43:41,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:43:41,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:41,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:43:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:43:41,061 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 6 states. [2019-12-18 18:43:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:42,053 INFO L93 Difference]: Finished difference Result 51798 states and 162133 transitions. [2019-12-18 18:43:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:43:42,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 18:43:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:42,138 INFO L225 Difference]: With dead ends: 51798 [2019-12-18 18:43:42,138 INFO L226 Difference]: Without dead ends: 51791 [2019-12-18 18:43:42,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:43:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51791 states. [2019-12-18 18:43:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51791 to 37959. [2019-12-18 18:43:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37959 states. [2019-12-18 18:43:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37959 states to 37959 states and 122122 transitions. [2019-12-18 18:43:43,446 INFO L78 Accepts]: Start accepts. Automaton has 37959 states and 122122 transitions. Word has length 19 [2019-12-18 18:43:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:43,446 INFO L462 AbstractCegarLoop]: Abstraction has 37959 states and 122122 transitions. [2019-12-18 18:43:43,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:43:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37959 states and 122122 transitions. [2019-12-18 18:43:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:43:43,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:43,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:43,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1849670276, now seen corresponding path program 2 times [2019-12-18 18:43:43,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:43,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758011907] [2019-12-18 18:43:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:43,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758011907] [2019-12-18 18:43:43,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:43,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:43:43,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098123801] [2019-12-18 18:43:43,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:43:43,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:43:43,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:43,549 INFO L87 Difference]: Start difference. First operand 37959 states and 122122 transitions. Second operand 5 states. [2019-12-18 18:43:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:44,301 INFO L93 Difference]: Finished difference Result 47787 states and 150948 transitions. [2019-12-18 18:43:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:43:44,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:43:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:44,381 INFO L225 Difference]: With dead ends: 47787 [2019-12-18 18:43:44,381 INFO L226 Difference]: Without dead ends: 47780 [2019-12-18 18:43:44,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:43:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47780 states. [2019-12-18 18:43:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47780 to 38059. [2019-12-18 18:43:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-18 18:43:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-18 18:43:45,823 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-18 18:43:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:45,823 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-18 18:43:45,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:43:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-18 18:43:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:43:45,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:45,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:45,833 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:45,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:45,833 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-18 18:43:45,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:45,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003712907] [2019-12-18 18:43:45,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:45,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003712907] [2019-12-18 18:43:45,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:45,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:43:45,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026227221] [2019-12-18 18:43:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:43:45,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:43:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:43:45,886 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-18 18:43:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:45,923 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-18 18:43:45,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:43:45,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:43:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:45,932 INFO L225 Difference]: With dead ends: 7382 [2019-12-18 18:43:45,932 INFO L226 Difference]: Without dead ends: 7382 [2019-12-18 18:43:45,932 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-18 18:43:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-18 18:43:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-18 18:43:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-18 18:43:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-18 18:43:46,030 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-18 18:43:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:46,031 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-18 18:43:46,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:43:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-18 18:43:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:43:46,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:46,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:46,040 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-18 18:43:46,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:46,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709432593] [2019-12-18 18:43:46,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:46,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709432593] [2019-12-18 18:43:46,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:46,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:43:46,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065326210] [2019-12-18 18:43:46,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:43:46,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:46,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:43:46,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:46,109 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-18 18:43:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:46,148 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-18 18:43:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:43:46,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:43:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:46,157 INFO L225 Difference]: With dead ends: 5311 [2019-12-18 18:43:46,158 INFO L226 Difference]: Without dead ends: 5311 [2019-12-18 18:43:46,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-18 18:43:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-18 18:43:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-18 18:43:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-18 18:43:46,231 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-18 18:43:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-18 18:43:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:43:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-18 18:43:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:43:46,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:46,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:46,241 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-18 18:43:46,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:46,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368561474] [2019-12-18 18:43:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:46,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368561474] [2019-12-18 18:43:46,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:46,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:43:46,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966183928] [2019-12-18 18:43:46,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:43:46,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:43:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:46,332 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-18 18:43:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:46,388 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-18 18:43:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:46,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:43:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:46,396 INFO L225 Difference]: With dead ends: 4958 [2019-12-18 18:43:46,396 INFO L226 Difference]: Without dead ends: 4958 [2019-12-18 18:43:46,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-18 18:43:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-18 18:43:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-18 18:43:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-18 18:43:46,463 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-18 18:43:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:46,464 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-18 18:43:46,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-18 18:43:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:43:46,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:46,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:46,472 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:46,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-18 18:43:46,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:46,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657884655] [2019-12-18 18:43:46,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:46,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657884655] [2019-12-18 18:43:46,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:46,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:46,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852128848] [2019-12-18 18:43:46,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:43:46,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:43:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:46,571 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 3 states. [2019-12-18 18:43:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:46,613 INFO L93 Difference]: Finished difference Result 4666 states and 13243 transitions. [2019-12-18 18:43:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:46,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:43:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:46,624 INFO L225 Difference]: With dead ends: 4666 [2019-12-18 18:43:46,624 INFO L226 Difference]: Without dead ends: 4666 [2019-12-18 18:43:46,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-18 18:43:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-18 18:43:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 18:43:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13243 transitions. [2019-12-18 18:43:46,724 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13243 transitions. Word has length 65 [2019-12-18 18:43:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:46,724 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13243 transitions. [2019-12-18 18:43:46,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13243 transitions. [2019-12-18 18:43:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:43:46,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:46,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:46,733 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash -707320023, now seen corresponding path program 1 times [2019-12-18 18:43:46,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:46,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727072193] [2019-12-18 18:43:46,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:46,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727072193] [2019-12-18 18:43:46,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:46,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:43:46,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838063934] [2019-12-18 18:43:46,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:43:46,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:43:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:46,840 INFO L87 Difference]: Start difference. First operand 4666 states and 13243 transitions. Second operand 5 states. [2019-12-18 18:43:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:47,121 INFO L93 Difference]: Finished difference Result 7090 states and 19974 transitions. [2019-12-18 18:43:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:43:47,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 18:43:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:47,136 INFO L225 Difference]: With dead ends: 7090 [2019-12-18 18:43:47,137 INFO L226 Difference]: Without dead ends: 7090 [2019-12-18 18:43:47,137 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-18 18:43:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-18 18:43:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5825. [2019-12-18 18:43:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-12-18 18:43:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 16556 transitions. [2019-12-18 18:43:47,287 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 16556 transitions. Word has length 66 [2019-12-18 18:43:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:47,288 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 16556 transitions. [2019-12-18 18:43:47,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:43:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 16556 transitions. [2019-12-18 18:43:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:43:47,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:47,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:47,300 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 429063715, now seen corresponding path program 2 times [2019-12-18 18:43:47,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:47,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793290615] [2019-12-18 18:43:47,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:47,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793290615] [2019-12-18 18:43:47,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:43:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570168650] [2019-12-18 18:43:47,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:43:47,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:43:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:43:47,438 INFO L87 Difference]: Start difference. First operand 5825 states and 16556 transitions. Second operand 5 states. [2019-12-18 18:43:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:47,763 INFO L93 Difference]: Finished difference Result 8400 states and 23631 transitions. [2019-12-18 18:43:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:43:47,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 18:43:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:47,774 INFO L225 Difference]: With dead ends: 8400 [2019-12-18 18:43:47,775 INFO L226 Difference]: Without dead ends: 8400 [2019-12-18 18:43:47,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:43:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2019-12-18 18:43:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 6173. [2019-12-18 18:43:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-18 18:43:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17589 transitions. [2019-12-18 18:43:47,871 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17589 transitions. Word has length 66 [2019-12-18 18:43:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:47,871 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17589 transitions. [2019-12-18 18:43:47,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:43:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17589 transitions. [2019-12-18 18:43:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:43:47,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:47,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:47,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2071652769, now seen corresponding path program 3 times [2019-12-18 18:43:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:47,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666342344] [2019-12-18 18:43:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:47,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666342344] [2019-12-18 18:43:47,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:47,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:43:48,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283924339] [2019-12-18 18:43:48,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:43:48,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:43:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:43:48,001 INFO L87 Difference]: Start difference. First operand 6173 states and 17589 transitions. Second operand 6 states. [2019-12-18 18:43:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:48,595 INFO L93 Difference]: Finished difference Result 8757 states and 24595 transitions. [2019-12-18 18:43:48,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:43:48,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 18:43:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:48,608 INFO L225 Difference]: With dead ends: 8757 [2019-12-18 18:43:48,609 INFO L226 Difference]: Without dead ends: 8757 [2019-12-18 18:43:48,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:43:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-12-18 18:43:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 6362. [2019-12-18 18:43:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-12-18 18:43:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 18145 transitions. [2019-12-18 18:43:48,767 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 18145 transitions. Word has length 66 [2019-12-18 18:43:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:48,768 INFO L462 AbstractCegarLoop]: Abstraction has 6362 states and 18145 transitions. [2019-12-18 18:43:48,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:43:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 18145 transitions. [2019-12-18 18:43:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:43:49,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:49,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:49,149 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1231010579, now seen corresponding path program 4 times [2019-12-18 18:43:49,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:49,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757025762] [2019-12-18 18:43:49,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:49,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757025762] [2019-12-18 18:43:49,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:49,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:43:49,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851846008] [2019-12-18 18:43:49,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:43:49,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:43:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:43:49,354 INFO L87 Difference]: Start difference. First operand 6362 states and 18145 transitions. Second operand 9 states. [2019-12-18 18:43:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:50,307 INFO L93 Difference]: Finished difference Result 13482 states and 38527 transitions. [2019-12-18 18:43:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 18:43:50,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:43:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:50,324 INFO L225 Difference]: With dead ends: 13482 [2019-12-18 18:43:50,324 INFO L226 Difference]: Without dead ends: 13482 [2019-12-18 18:43:50,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:43:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13482 states. [2019-12-18 18:43:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13482 to 6626. [2019-12-18 18:43:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6626 states. [2019-12-18 18:43:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 18995 transitions. [2019-12-18 18:43:50,459 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 18995 transitions. Word has length 66 [2019-12-18 18:43:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:50,460 INFO L462 AbstractCegarLoop]: Abstraction has 6626 states and 18995 transitions. [2019-12-18 18:43:50,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:43:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 18995 transitions. [2019-12-18 18:43:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:43:50,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:50,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:50,470 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2078646397, now seen corresponding path program 5 times [2019-12-18 18:43:50,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:50,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069195480] [2019-12-18 18:43:50,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:50,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069195480] [2019-12-18 18:43:50,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:50,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:50,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378116102] [2019-12-18 18:43:50,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:43:50,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:43:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:50,548 INFO L87 Difference]: Start difference. First operand 6626 states and 18995 transitions. Second operand 3 states. [2019-12-18 18:43:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:50,605 INFO L93 Difference]: Finished difference Result 6626 states and 18994 transitions. [2019-12-18 18:43:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:50,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:43:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:50,615 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 18:43:50,615 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 18:43:50,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 18:43:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 4033. [2019-12-18 18:43:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2019-12-18 18:43:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 11698 transitions. [2019-12-18 18:43:50,694 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 11698 transitions. Word has length 66 [2019-12-18 18:43:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:50,694 INFO L462 AbstractCegarLoop]: Abstraction has 4033 states and 11698 transitions. [2019-12-18 18:43:50,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 11698 transitions. [2019-12-18 18:43:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:43:50,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:50,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:50,701 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1492386830, now seen corresponding path program 1 times [2019-12-18 18:43:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:50,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140656361] [2019-12-18 18:43:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:50,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140656361] [2019-12-18 18:43:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:50,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:43:50,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553956555] [2019-12-18 18:43:50,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:43:50,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:43:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:50,774 INFO L87 Difference]: Start difference. First operand 4033 states and 11698 transitions. Second operand 3 states. [2019-12-18 18:43:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:50,801 INFO L93 Difference]: Finished difference Result 3723 states and 10543 transitions. [2019-12-18 18:43:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:43:50,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:43:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:50,807 INFO L225 Difference]: With dead ends: 3723 [2019-12-18 18:43:50,808 INFO L226 Difference]: Without dead ends: 3723 [2019-12-18 18:43:50,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:43:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-12-18 18:43:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 2989. [2019-12-18 18:43:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-18 18:43:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-18 18:43:50,872 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-18 18:43:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:50,872 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-18 18:43:50,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:43:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-18 18:43:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:43:50,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:50,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:50,882 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-18 18:43:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:50,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965581712] [2019-12-18 18:43:50,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:43:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:43:51,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965581712] [2019-12-18 18:43:51,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:43:51,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:43:51,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490145965] [2019-12-18 18:43:51,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:43:51,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:43:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:43:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:43:51,142 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 12 states. [2019-12-18 18:43:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:43:51,567 INFO L93 Difference]: Finished difference Result 5702 states and 16070 transitions. [2019-12-18 18:43:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:43:51,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 18:43:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:43:51,575 INFO L225 Difference]: With dead ends: 5702 [2019-12-18 18:43:51,575 INFO L226 Difference]: Without dead ends: 5670 [2019-12-18 18:43:51,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:43:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2019-12-18 18:43:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4144. [2019-12-18 18:43:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-18 18:43:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-18 18:43:51,676 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-18 18:43:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:43:51,676 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-18 18:43:51,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:43:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-18 18:43:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:43:51,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:43:51,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:43:51,681 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:43:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:43:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-18 18:43:51,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:43:51,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034489445] [2019-12-18 18:43:51,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:43:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:43:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:43:51,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:43:51,853 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:43:51,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2189~0.base_27| 4) |v_#length_25|) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27| 1)) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27|) |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27|)) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2189~0.base_27|) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_18|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ULTIMATE.start_main_~#t2189~0.offset=|v_ULTIMATE.start_main_~#t2189~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_~#t2189~0.base=|v_ULTIMATE.start_main_~#t2189~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2191~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2190~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t2189~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2191~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2189~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2190~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:43:51,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:43:51,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2190~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11|) |v_ULTIMATE.start_main_~#t2190~0.offset_10| 1))) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11| 1) |v_#valid_37|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2190~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2190~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2190~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2190~0.offset] because there is no mapped edge [2019-12-18 18:43:51,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2191~0.offset_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13|) |v_ULTIMATE.start_main_~#t2191~0.offset_11| 2))) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2191~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2191~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2191~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2191~0.base, #length, ULTIMATE.start_main_~#t2191~0.offset] because there is no mapped edge [2019-12-18 18:43:51,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1126024031 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1126024031 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1126024031|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1126024031 |P0Thread1of1ForFork0_#t~ite5_Out-1126024031|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126024031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1126024031} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1126024031|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126024031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1126024031} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:43:51,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2023309791 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2023309791 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-2023309791| ~y~0_In-2023309791)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2023309791| ~y$w_buff1~0_In-2023309791) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2023309791, ~y$w_buff1~0=~y$w_buff1~0_In-2023309791, ~y~0=~y~0_In-2023309791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2023309791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2023309791, ~y$w_buff1~0=~y$w_buff1~0_In-2023309791, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2023309791|, ~y~0=~y~0_In-2023309791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2023309791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 18:43:51,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In779752879 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In779752879 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In779752879 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In779752879 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out779752879| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out779752879| ~y$w_buff1_used~0_In779752879) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In779752879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In779752879, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In779752879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In779752879} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out779752879|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In779752879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In779752879, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In779752879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In779752879} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:43:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In552261684 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In552261684 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out552261684)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out552261684 ~y$r_buff0_thd1~0_In552261684)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In552261684, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In552261684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In552261684, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out552261684|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out552261684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:43:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1450418925 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1450418925 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1450418925 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1450418925 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1450418925|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1450418925 |P0Thread1of1ForFork0_#t~ite8_Out1450418925|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1450418925, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450418925, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1450418925, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1450418925} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1450418925, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450418925, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1450418925|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1450418925, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1450418925} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:43:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |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_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:43:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1789148875 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1789148875 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1789148875| ~y$w_buff1~0_In1789148875) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1789148875| ~y~0_In1789148875) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1789148875, ~y$w_buff1~0=~y$w_buff1~0_In1789148875, ~y~0=~y~0_In1789148875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789148875} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1789148875, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1789148875|, ~y$w_buff1~0=~y$w_buff1~0_In1789148875, ~y~0=~y~0_In1789148875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789148875} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:43:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 18:43:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 18:43:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-485100397 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-485100397 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-485100397| 0)) (and (= ~y$w_buff0_used~0_In-485100397 |P1Thread1of1ForFork1_#t~ite11_Out-485100397|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-485100397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-485100397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-485100397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-485100397, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-485100397|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:43:51,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1138565118 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1138565118 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1138565118 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1138565118 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1138565118| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1138565118| ~y$w_buff1_used~0_In-1138565118)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1138565118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138565118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138565118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1138565118} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1138565118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138565118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138565118, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1138565118|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1138565118} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:43:51,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1277560124 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1277560124 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1277560124|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1277560124 |P1Thread1of1ForFork1_#t~ite13_Out1277560124|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1277560124, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1277560124} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1277560124, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1277560124, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1277560124|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:43:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-278432559 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-278432559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-278432559 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-278432559 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-278432559|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-278432559| ~y$r_buff1_thd2~0_In-278432559) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-278432559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-278432559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-278432559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278432559} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-278432559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-278432559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-278432559, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-278432559|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278432559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:43:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In11348173 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In11348173 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out11348173| ~y$w_buff0_used~0_In11348173)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out11348173| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In11348173, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11348173} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In11348173, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11348173, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out11348173|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:43:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-830781732 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-830781732 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-830781732 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-830781732 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-830781732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out-830781732| ~y$w_buff1_used~0_In-830781732)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-830781732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-830781732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-830781732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-830781732} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-830781732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-830781732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-830781732, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-830781732|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-830781732} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:43:51,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:43:51,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1734055779 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1734055779 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1734055779| ~y$r_buff0_thd3~0_In1734055779)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1734055779|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1734055779, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1734055779} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1734055779, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1734055779, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1734055779|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:43:51,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In2033846233 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2033846233 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2033846233 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2033846233 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out2033846233| ~y$r_buff1_thd3~0_In2033846233) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out2033846233| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2033846233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2033846233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2033846233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2033846233} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2033846233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2033846233, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out2033846233|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2033846233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2033846233} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:43:51,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:43:51,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:43:51,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1010637282| |ULTIMATE.start_main_#t~ite24_Out-1010637282|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1010637282 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1010637282 256)))) (or (and .cse0 (= ~y~0_In-1010637282 |ULTIMATE.start_main_#t~ite24_Out-1010637282|) (or .cse1 .cse2)) (and .cse0 (= ~y$w_buff1~0_In-1010637282 |ULTIMATE.start_main_#t~ite24_Out-1010637282|) (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1010637282, ~y~0=~y~0_In-1010637282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1010637282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1010637282} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1010637282, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1010637282|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1010637282|, ~y~0=~y~0_In-1010637282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1010637282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1010637282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:43:51,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1865051232 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1865051232 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1865051232 |ULTIMATE.start_main_#t~ite26_Out-1865051232|)) (and (= |ULTIMATE.start_main_#t~ite26_Out-1865051232| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865051232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1865051232} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865051232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1865051232, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1865051232|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:43:51,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-691811478 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-691811478 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-691811478 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-691811478 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-691811478| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-691811478 |ULTIMATE.start_main_#t~ite27_Out-691811478|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-691811478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-691811478, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-691811478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691811478} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-691811478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-691811478, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-691811478|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-691811478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-691811478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:43:51,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-644689464 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-644689464 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-644689464 |ULTIMATE.start_main_#t~ite28_Out-644689464|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-644689464| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-644689464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644689464} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-644689464|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-644689464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644689464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:43:51,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1398955995 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1398955995 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1398955995 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1398955995 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-1398955995|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1398955995| ~y$r_buff1_thd0~0_In-1398955995)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398955995, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1398955995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1398955995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398955995} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398955995, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1398955995|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1398955995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1398955995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398955995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:43:51,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1090612400 256) 0))) (or (and (= ~y$w_buff1~0_In-1090612400 |ULTIMATE.start_main_#t~ite39_Out-1090612400|) (= |ULTIMATE.start_main_#t~ite38_In-1090612400| |ULTIMATE.start_main_#t~ite38_Out-1090612400|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1090612400 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1090612400 256))) (= 0 (mod ~y$w_buff0_used~0_In-1090612400 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1090612400 256))))) (= |ULTIMATE.start_main_#t~ite39_Out-1090612400| |ULTIMATE.start_main_#t~ite38_Out-1090612400|) (= ~y$w_buff1~0_In-1090612400 |ULTIMATE.start_main_#t~ite38_Out-1090612400|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1090612400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1090612400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1090612400, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1090612400|, ~weak$$choice2~0=~weak$$choice2~0_In-1090612400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1090612400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1090612400} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1090612400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1090612400, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1090612400|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1090612400, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1090612400|, ~weak$$choice2~0=~weak$$choice2~0_In-1090612400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1090612400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1090612400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 18:43:51,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1666281535 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In1666281535 |ULTIMATE.start_main_#t~ite42_Out1666281535|) (= |ULTIMATE.start_main_#t~ite41_In1666281535| |ULTIMATE.start_main_#t~ite41_Out1666281535|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1666281535| ~y$w_buff0_used~0_In1666281535) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1666281535 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1666281535 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1666281535 256))) (and (= 0 (mod ~y$w_buff1_used~0_In1666281535 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite41_Out1666281535| |ULTIMATE.start_main_#t~ite42_Out1666281535|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1666281535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1666281535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1666281535, ~weak$$choice2~0=~weak$$choice2~0_In1666281535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1666281535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1666281535} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1666281535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1666281535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1666281535, ~weak$$choice2~0=~weak$$choice2~0_In1666281535, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1666281535|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1666281535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1666281535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:43:51,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:43:51,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:43:51,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:43:52,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:43:52 BasicIcfg [2019-12-18 18:43:52,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:43:52,050 INFO L168 Benchmark]: Toolchain (without parser) took 76836.18 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 102.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,052 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 154.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.01 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,055 INFO L168 Benchmark]: Boogie Preprocessor took 83.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,057 INFO L168 Benchmark]: RCFGBuilder took 934.14 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,058 INFO L168 Benchmark]: TraceAbstraction took 74865.91 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:43:52,070 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.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 841.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 154.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 104.01 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 934.14 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74865.91 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2840 SDtfs, 2356 SDslu, 4912 SDs, 0 SdLazy, 3272 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 26 SyntacticMatches, 19 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 63078 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 718 ConstructedInterpolants, 0 QuantifiedInterpolants, 126463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...