/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:55:27,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:55:27,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:55:27,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:55:27,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:55:27,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:55:27,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:55:27,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:55:27,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:55:27,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:55:27,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:55:27,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:55:27,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:55:27,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:55:27,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:55:27,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:55:27,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:55:27,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:55:27,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:55:27,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:55:27,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:55:27,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:55:27,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:55:27,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:55:27,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:55:27,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:55:27,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:55:27,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:55:27,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:55:27,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:55:27,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:55:27,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:55:27,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:55:27,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:55:27,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:55:27,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:55:28,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:55:28,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:55:28,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:55:28,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:55:28,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:55:28,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:55:28,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:55:28,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:55:28,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:55:28,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:55:28,019 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:55:28,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:55:28,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:55:28,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:55:28,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:55:28,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:55:28,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:55:28,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:55:28,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:55:28,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:55:28,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:55:28,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:55:28,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:55:28,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:55:28,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:55:28,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:55:28,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:55:28,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:55:28,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:55:28,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:55:28,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:55:28,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:55:28,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:55:28,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:55:28,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:55:28,345 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:55:28,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_rmo.oepc.i [2019-12-18 21:55:28,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9187bb71c/1058c005dcaa4470a6f721023111e03f/FLAG8544721d1 [2019-12-18 21:55:28,989 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:55:28,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_rmo.oepc.i [2019-12-18 21:55:29,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9187bb71c/1058c005dcaa4470a6f721023111e03f/FLAG8544721d1 [2019-12-18 21:55:29,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9187bb71c/1058c005dcaa4470a6f721023111e03f [2019-12-18 21:55:29,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:55:29,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:55:29,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:29,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:55:29,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:55:29,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d44604a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29, skipping insertion in model container [2019-12-18 21:55:29,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:55:29,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:55:29,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:29,935 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:55:30,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:30,097 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:55:30,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30 WrapperNode [2019-12-18 21:55:30,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:30,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:30,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:55:30,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:55:30,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:30,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:55:30,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:55:30,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:55:30,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (1/1) ... [2019-12-18 21:55:30,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:55:30,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:55:30,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:55:30,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:55:30,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (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 21:55:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:55:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:55:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:55:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:55:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:55:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:55:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:55:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:55:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:55:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:55:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:55:30,285 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 21:55:31,005 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:55:31,006 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:55:31,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:31 BoogieIcfgContainer [2019-12-18 21:55:31,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:55:31,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:55:31,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:55:31,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:55:31,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:55:29" (1/3) ... [2019-12-18 21:55:31,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f391eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:31, skipping insertion in model container [2019-12-18 21:55:31,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:30" (2/3) ... [2019-12-18 21:55:31,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f391eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:31, skipping insertion in model container [2019-12-18 21:55:31,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:31" (3/3) ... [2019-12-18 21:55:31,016 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_rmo.oepc.i [2019-12-18 21:55:31,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:55:31,027 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:55:31,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:55:31,036 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:55:31,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,143 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:31,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:55:31,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:55:31,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:55:31,190 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:55:31,190 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:55:31,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:55:31,190 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:55:31,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:55:31,191 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:55:31,213 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:55:31,215 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:55:31,315 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:55:31,316 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:31,331 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:55:31,351 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:55:31,390 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:55:31,390 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:31,397 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:55:31,412 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:55:31,413 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:55:34,852 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:55:34,984 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 21:55:34,984 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:55:34,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 21:55:35,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:55:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:55:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:55:35,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:35,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:55:35,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 21:55:35,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:35,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342673044] [2019-12-18 21:55:35,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:35,799 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 21:55:35,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342673044] [2019-12-18 21:55:35,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:35,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:55:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048534599] [2019-12-18 21:55:35,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:35,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:35,830 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:55:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:36,164 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 21:55:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:36,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:55:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:36,280 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 21:55:36,280 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 21:55:36,282 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 21:55:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 21:55:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 21:55:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 21:55:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 21:55:36,756 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 21:55:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:36,756 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 21:55:36,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 21:55:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:55:36,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:36,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:36,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 21:55:36,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:36,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237167919] [2019-12-18 21:55:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:36,883 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 21:55:36,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237167919] [2019-12-18 21:55:36,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:36,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:36,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631765354] [2019-12-18 21:55:36,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:55:36,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:55:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:55:36,888 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 21:55:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:36,983 INFO L93 Difference]: Finished difference Result 1719 states and 4310 transitions. [2019-12-18 21:55:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:55:36,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:55:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:36,994 INFO L225 Difference]: With dead ends: 1719 [2019-12-18 21:55:36,995 INFO L226 Difference]: Without dead ends: 1263 [2019-12-18 21:55:36,997 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 21:55:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-18 21:55:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2019-12-18 21:55:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-18 21:55:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2849 transitions. [2019-12-18 21:55:37,048 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2849 transitions. Word has length 11 [2019-12-18 21:55:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:37,049 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 2849 transitions. [2019-12-18 21:55:37,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:55:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2849 transitions. [2019-12-18 21:55:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:55:37,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:37,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:37,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 21:55:37,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425789126] [2019-12-18 21:55:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:37,237 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 21:55:37,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425789126] [2019-12-18 21:55:37,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:37,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:37,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064175607] [2019-12-18 21:55:37,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:37,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:37,239 INFO L87 Difference]: Start difference. First operand 1263 states and 2849 transitions. Second operand 5 states. [2019-12-18 21:55:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:37,528 INFO L93 Difference]: Finished difference Result 1830 states and 4011 transitions. [2019-12-18 21:55:37,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:55:37,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:55:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:37,538 INFO L225 Difference]: With dead ends: 1830 [2019-12-18 21:55:37,539 INFO L226 Difference]: Without dead ends: 1830 [2019-12-18 21:55:37,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-18 21:55:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1523. [2019-12-18 21:55:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-18 21:55:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-18 21:55:37,585 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 14 [2019-12-18 21:55:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:37,586 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-18 21:55:37,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-18 21:55:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:55:37,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:37,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:37,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 21:55:37,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:37,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944206049] [2019-12-18 21:55:37,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:37,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 21:55:37,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944206049] [2019-12-18 21:55:37,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:37,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:55:37,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405073147] [2019-12-18 21:55:37,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:55:37,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:55:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:55:37,747 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-18 21:55:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:38,229 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-18 21:55:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:55:38,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:55:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:38,244 INFO L225 Difference]: With dead ends: 2313 [2019-12-18 21:55:38,244 INFO L226 Difference]: Without dead ends: 2260 [2019-12-18 21:55:38,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:55:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-18 21:55:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-18 21:55:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-18 21:55:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-18 21:55:38,392 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-18 21:55:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:38,392 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-18 21:55:38,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:55:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-18 21:55:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:55:38,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:38,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:38,396 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-18 21:55:38,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:38,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305249877] [2019-12-18 21:55:38,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:38,475 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 21:55:38,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305249877] [2019-12-18 21:55:38,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:38,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:55:38,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683759572] [2019-12-18 21:55:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:38,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:38,477 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 5 states. [2019-12-18 21:55:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:38,887 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-18 21:55:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:55:38,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:55:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:38,900 INFO L225 Difference]: With dead ends: 2343 [2019-12-18 21:55:38,900 INFO L226 Difference]: Without dead ends: 2343 [2019-12-18 21:55:38,901 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 21:55:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-18 21:55:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-18 21:55:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-18 21:55:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-18 21:55:38,953 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-18 21:55:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:38,953 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-18 21:55:38,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-18 21:55:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:55:38,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:38,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:38,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-18 21:55:38,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:38,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90299811] [2019-12-18 21:55:38,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,046 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 21:55:39,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90299811] [2019-12-18 21:55:39,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:55:39,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565181550] [2019-12-18 21:55:39,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:39,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:39,050 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 5 states. [2019-12-18 21:55:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:39,095 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-18 21:55:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:55:39,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:55:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:39,107 INFO L225 Difference]: With dead ends: 1263 [2019-12-18 21:55:39,108 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 21:55:39,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 21:55:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-18 21:55:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-18 21:55:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-18 21:55:39,132 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-18 21:55:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:39,133 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-18 21:55:39,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-18 21:55:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:55:39,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:39,138 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] [2019-12-18 21:55:39,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:39,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-18 21:55:39,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:39,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053765468] [2019-12-18 21:55:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,255 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 21:55:39,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053765468] [2019-12-18 21:55:39,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:55:39,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791009123] [2019-12-18 21:55:39,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:55:39,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:55:39,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:39,259 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-18 21:55:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:39,622 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-18 21:55:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:55:39,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:55:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:39,631 INFO L225 Difference]: With dead ends: 3013 [2019-12-18 21:55:39,632 INFO L226 Difference]: Without dead ends: 2064 [2019-12-18 21:55:39,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:55:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-18 21:55:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-18 21:55:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 21:55:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-18 21:55:39,664 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-18 21:55:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:39,664 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-18 21:55:39,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:55:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-18 21:55:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:55:39,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:39,668 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] [2019-12-18 21:55:39,668 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-18 21:55:39,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:39,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908284047] [2019-12-18 21:55:39,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,731 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 21:55:39,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908284047] [2019-12-18 21:55:39,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:39,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768369075] [2019-12-18 21:55:39,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:55:39,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:55:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:55:39,734 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-18 21:55:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:39,754 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-18 21:55:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:55:39,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-18 21:55:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:39,759 INFO L225 Difference]: With dead ends: 1851 [2019-12-18 21:55:39,759 INFO L226 Difference]: Without dead ends: 818 [2019-12-18 21:55:39,760 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 21:55:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-18 21:55:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-18 21:55:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-18 21:55:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-18 21:55:39,778 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-18 21:55:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:39,778 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-18 21:55:39,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:55:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-18 21:55:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:55:39,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:39,781 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] [2019-12-18 21:55:39,781 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-18 21:55:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020968789] [2019-12-18 21:55:39,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,891 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 21:55:39,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020968789] [2019-12-18 21:55:39,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:55:39,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761170787] [2019-12-18 21:55:39,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:55:39,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:55:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:39,895 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 7 states. [2019-12-18 21:55:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,120 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-18 21:55:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:55:40,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:55:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,124 INFO L225 Difference]: With dead ends: 1396 [2019-12-18 21:55:40,125 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 21:55:40,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:55:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 21:55:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-18 21:55:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-18 21:55:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-18 21:55:40,144 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-18 21:55:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,144 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-18 21:55:40,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:55:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-18 21:55:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:55:40,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,147 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] [2019-12-18 21:55:40,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-18 21:55:40,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010404320] [2019-12-18 21:55:40,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:40,223 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 21:55:40,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010404320] [2019-12-18 21:55:40,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:40,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:55:40,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382959246] [2019-12-18 21:55:40,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:40,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:40,226 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-18 21:55:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,275 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-18 21:55:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:40,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:55:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,280 INFO L225 Difference]: With dead ends: 1036 [2019-12-18 21:55:40,280 INFO L226 Difference]: Without dead ends: 1036 [2019-12-18 21:55:40,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 21:55:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-18 21:55:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-18 21:55:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 21:55:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-18 21:55:40,306 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-18 21:55:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,307 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-18 21:55:40,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-18 21:55:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:40,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:40,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-18 21:55:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199623161] [2019-12-18 21:55:40,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:40,454 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 21:55:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199623161] [2019-12-18 21:55:40,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:40,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:55:40,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279268622] [2019-12-18 21:55:40,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:55:40,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:55:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:55:40,457 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 6 states. [2019-12-18 21:55:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,936 INFO L93 Difference]: Finished difference Result 993 states and 2070 transitions. [2019-12-18 21:55:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:55:40,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:55:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,939 INFO L225 Difference]: With dead ends: 993 [2019-12-18 21:55:40,939 INFO L226 Difference]: Without dead ends: 993 [2019-12-18 21:55:40,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:55:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-18 21:55:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 900. [2019-12-18 21:55:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-18 21:55:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1900 transitions. [2019-12-18 21:55:40,962 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1900 transitions. Word has length 52 [2019-12-18 21:55:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,962 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1900 transitions. [2019-12-18 21:55:40,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:55:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1900 transitions. [2019-12-18 21:55:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:40,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:40,965 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-18 21:55:40,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615019676] [2019-12-18 21:55:40,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:41,151 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 21:55:41,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615019676] [2019-12-18 21:55:41,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:41,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:55:41,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625599186] [2019-12-18 21:55:41,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:41,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:41,154 INFO L87 Difference]: Start difference. First operand 900 states and 1900 transitions. Second operand 3 states. [2019-12-18 21:55:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:41,167 INFO L93 Difference]: Finished difference Result 899 states and 1898 transitions. [2019-12-18 21:55:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:55:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:41,171 INFO L225 Difference]: With dead ends: 899 [2019-12-18 21:55:41,171 INFO L226 Difference]: Without dead ends: 899 [2019-12-18 21:55:41,172 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 21:55:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-18 21:55:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 743. [2019-12-18 21:55:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 21:55:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-18 21:55:41,188 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-18 21:55:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:41,188 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-18 21:55:41,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-18 21:55:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:55:41,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:41,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:41,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 21:55:41,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:41,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150275128] [2019-12-18 21:55:41,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:55:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:55:41,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:55:41,318 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:55:41,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1553~0.base_24| 1)) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1553~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1553~0.base_24|) |v_ULTIMATE.start_main_~#t1553~0.offset_19| 0))) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= 0 |v_ULTIMATE.start_main_~#t1553~0.offset_19|) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1553~0.base_24|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1553~0.base_24|)) (= v_~y$w_buff0_used~0_106 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1553~0.base_24| 4) |v_#length_17|) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_~#t1553~0.base=|v_ULTIMATE.start_main_~#t1553~0.base_24|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_~#t1554~0.offset=|v_ULTIMATE.start_main_~#t1554~0.offset_19|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1554~0.base=|v_ULTIMATE.start_main_~#t1554~0.base_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ULTIMATE.start_main_~#t1553~0.offset=|v_ULTIMATE.start_main_~#t1553~0.offset_19|, ~y~0=v_~y~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1553~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1554~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1554~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1553~0.offset, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:55:41,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1554~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1554~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1554~0.base_13|) |v_ULTIMATE.start_main_~#t1554~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1554~0.base_13| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1554~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1554~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1554~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1554~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1554~0.base=|v_ULTIMATE.start_main_~#t1554~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1554~0.offset=|v_ULTIMATE.start_main_~#t1554~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1554~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1554~0.offset] because there is no mapped edge [2019-12-18 21:55:41,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-1632547417 ~x~0_In-1632547417) (= 1 ~y$r_buff0_thd1~0_Out-1632547417) (= ~y$r_buff1_thd1~0_Out-1632547417 ~y$r_buff0_thd1~0_In-1632547417) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1632547417 0)) (= ~y$r_buff1_thd0~0_Out-1632547417 ~y$r_buff0_thd0~0_In-1632547417) (= ~y$r_buff0_thd2~0_In-1632547417 ~y$r_buff1_thd2~0_Out-1632547417)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1632547417, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1632547417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1632547417, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1632547417, ~x~0=~x~0_In-1632547417} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1632547417, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1632547417, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1632547417, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1632547417, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1632547417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1632547417, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1632547417, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1632547417, ~x~0=~x~0_In-1632547417} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:55:41,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-904343568 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-904343568 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-904343568| ~y$w_buff0_used~0_In-904343568) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-904343568|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-904343568, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-904343568} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-904343568|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-904343568, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-904343568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:55:41,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-508101883 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-508101883| |P1Thread1of1ForFork1_#t~ite20_Out-508101883|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-508101883 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-508101883 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-508101883 256) 0)) (= (mod ~y$w_buff0_used~0_In-508101883 256) 0))) (= ~y$w_buff0_used~0_In-508101883 |P1Thread1of1ForFork1_#t~ite20_Out-508101883|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-508101883| ~y$w_buff0_used~0_In-508101883) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-508101883| |P1Thread1of1ForFork1_#t~ite20_Out-508101883|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-508101883, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-508101883, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-508101883|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-508101883, ~weak$$choice2~0=~weak$$choice2~0_In-508101883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-508101883} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-508101883, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-508101883, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-508101883|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-508101883, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-508101883|, ~weak$$choice2~0=~weak$$choice2~0_In-508101883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-508101883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:55:41,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-398389767 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-398389767| |P1Thread1of1ForFork1_#t~ite24_Out-398389767|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-398389767 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-398389767 256))) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-398389767 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-398389767 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-398389767| |P1Thread1of1ForFork1_#t~ite22_Out-398389767|) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-398389767| |P1Thread1of1ForFork1_#t~ite23_In-398389767|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-398389767| ~y$w_buff1_used~0_In-398389767)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-398389767| ~y$w_buff1_used~0_In-398389767) .cse1 .cse0 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3))))) (let ((.cse6 (not .cse3))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-398389767| |P1Thread1of1ForFork1_#t~ite23_Out-398389767|) (= |P1Thread1of1ForFork1_#t~ite22_Out-398389767| 0) (or (not .cse2) .cse6) .cse1 .cse0 (not .cse4) (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-398389767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-398389767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-398389767, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-398389767|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-398389767|, ~weak$$choice2~0=~weak$$choice2~0_In-398389767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-398389767} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-398389767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-398389767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-398389767, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-398389767|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-398389767|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-398389767|, ~weak$$choice2~0=~weak$$choice2~0_In-398389767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-398389767} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:55:41,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:55:41,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1807116123 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1807116123 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1807116123 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1807116123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1807116123| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1807116123| ~y$w_buff1_used~0_In-1807116123) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1807116123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1807116123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1807116123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1807116123} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1807116123|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1807116123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1807116123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1807116123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1807116123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:55:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1106612682 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1106612682 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-1106612682 ~y$r_buff0_thd1~0_Out-1106612682) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd1~0_Out-1106612682) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1106612682, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1106612682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1106612682, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1106612682|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1106612682} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:55:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1226171906 256))) (.cse3 (= |P1Thread1of1ForFork1_#t~ite30_Out1226171906| |P1Thread1of1ForFork1_#t~ite29_Out1226171906|)) (.cse4 (= (mod ~y$w_buff0_used~0_In1226171906 256) 0)) (.cse5 (= (mod ~y$w_buff1_used~0_In1226171906 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1226171906 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In1226171906 256)))) (or (let ((.cse1 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out1226171906| |P1Thread1of1ForFork1_#t~ite29_Out1226171906|) (or .cse1 (not .cse2)) (= |P1Thread1of1ForFork1_#t~ite28_Out1226171906| 0) .cse3 (not .cse4) (or .cse1 (not .cse5)))) (and (or (and (= ~y$r_buff1_thd2~0_In1226171906 |P1Thread1of1ForFork1_#t~ite30_Out1226171906|) (= |P1Thread1of1ForFork1_#t~ite29_In1226171906| |P1Thread1of1ForFork1_#t~ite29_Out1226171906|) (not .cse0)) (and .cse0 (= ~y$r_buff1_thd2~0_In1226171906 |P1Thread1of1ForFork1_#t~ite29_Out1226171906|) .cse3 (or .cse4 (and .cse5 .cse6) (and .cse2 .cse6)))) (= |P1Thread1of1ForFork1_#t~ite28_In1226171906| |P1Thread1of1ForFork1_#t~ite28_Out1226171906|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1226171906, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1226171906|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1226171906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1226171906, ~weak$$choice2~0=~weak$$choice2~0_In1226171906, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1226171906|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1226171906} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1226171906, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1226171906|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1226171906|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1226171906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1226171906, ~weak$$choice2~0=~weak$$choice2~0_In1226171906, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1226171906|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1226171906} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:55:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-56105005 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-56105005 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-56105005 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-56105005 256)))) (or (and (= ~y$r_buff1_thd1~0_In-56105005 |P0Thread1of1ForFork0_#t~ite8_Out-56105005|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-56105005|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-56105005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56105005, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-56105005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56105005} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-56105005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56105005, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-56105005|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-56105005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56105005} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:55:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-869688751 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-869688751 256) 0))) (or (and (= ~y~0_In-869688751 |P1Thread1of1ForFork1_#t~ite32_Out-869688751|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-869688751 |P1Thread1of1ForFork1_#t~ite32_Out-869688751|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-869688751, ~y$w_buff1~0=~y$w_buff1~0_In-869688751, ~y~0=~y~0_In-869688751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-869688751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-869688751, ~y$w_buff1~0=~y$w_buff1~0_In-869688751, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-869688751|, ~y~0=~y~0_In-869688751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-869688751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:55:41,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In400656484 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In400656484 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out400656484| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out400656484| ~y$w_buff0_used~0_In400656484) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In400656484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In400656484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In400656484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In400656484, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out400656484|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:55:41,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1585806573 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1585806573 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1585806573 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1585806573 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1585806573| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1585806573| ~y$w_buff1_used~0_In1585806573) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585806573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585806573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585806573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585806573} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585806573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585806573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585806573, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1585806573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585806573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:55:41,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1797549102 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1797549102 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1797549102| 0)) (and (= ~y$r_buff0_thd2~0_In1797549102 |P1Thread1of1ForFork1_#t~ite36_Out1797549102|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1797549102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797549102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1797549102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1797549102, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1797549102|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:55:41,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-191621854 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-191621854 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-191621854 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-191621854 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-191621854| ~y$r_buff1_thd2~0_In-191621854) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-191621854| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-191621854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-191621854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-191621854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-191621854} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-191621854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-191621854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-191621854, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-191621854|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-191621854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:55:41,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:55:41,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} 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 21:55:41,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:55:41,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In429006134 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In429006134 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out429006134| ~y~0_In429006134)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out429006134| ~y$w_buff1~0_In429006134) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In429006134, ~y~0=~y~0_In429006134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In429006134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In429006134} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out429006134|, ~y$w_buff1~0=~y$w_buff1~0_In429006134, ~y~0=~y~0_In429006134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In429006134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In429006134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:55:41,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In714820409 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In714820409 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In714820409 |ULTIMATE.start_main_#t~ite42_Out714820409|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out714820409|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In714820409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In714820409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In714820409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In714820409, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out714820409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:55:41,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1097871295 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1097871295 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1097871295 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1097871295 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1097871295| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1097871295| ~y$w_buff1_used~0_In1097871295)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1097871295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1097871295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1097871295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097871295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1097871295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1097871295, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1097871295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1097871295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097871295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:55:41,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1106200511 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1106200511 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1106200511|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1106200511 |ULTIMATE.start_main_#t~ite44_Out-1106200511|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1106200511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1106200511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1106200511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1106200511, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1106200511|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:55:41,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-819271290 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-819271290 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-819271290 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-819271290 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-819271290|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-819271290 |ULTIMATE.start_main_#t~ite45_Out-819271290|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-819271290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-819271290, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-819271290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819271290} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-819271290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-819271290, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-819271290, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-819271290|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819271290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:55:41,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:55:41,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:55:41 BasicIcfg [2019-12-18 21:55:41,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:55:41,403 INFO L168 Benchmark]: Toolchain (without parser) took 12114.56 ms. Allocated memory was 145.2 MB in the beginning and 382.2 MB in the end (delta: 237.0 MB). Free memory was 100.0 MB in the beginning and 241.3 MB in the end (delta: -141.4 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,403 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:55:41,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 156.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,405 INFO L168 Benchmark]: Boogie Preprocessor took 35.92 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,406 INFO L168 Benchmark]: RCFGBuilder took 805.38 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,407 INFO L168 Benchmark]: TraceAbstraction took 10392.75 ms. Allocated memory was 202.4 MB in the beginning and 382.2 MB in the end (delta: 179.8 MB). Free memory was 107.7 MB in the beginning and 241.3 MB in the end (delta: -133.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,411 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.19 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 156.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.92 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.38 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10392.75 ms. Allocated memory was 202.4 MB in the beginning and 382.2 MB in the end (delta: 179.8 MB). Free memory was 107.7 MB in the beginning and 241.3 MB in the end (delta: -133.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1524 SDtfs, 1674 SDslu, 3310 SDs, 0 SdLazy, 1633 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2915 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 52762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...