/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/mix048_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:36:15,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:36:15,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:36:15,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:36:15,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:36:15,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:36:15,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:36:15,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:36:15,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:36:15,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:36:15,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:36:15,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:36:15,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:36:15,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:36:15,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:36:15,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:36:15,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:36:15,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:36:15,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:36:15,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:36:15,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:36:15,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:36:15,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:36:15,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:36:15,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:36:15,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:36:15,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:36:15,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:36:15,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:36:15,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:36:15,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:36:15,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:36:15,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:36:15,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:36:15,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:36:15,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:36:15,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:36:15,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:36:15,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:36:15,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:36:15,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:36:15,986 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:36:16,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:36:16,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:36:16,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:36:16,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:36:16,002 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:36:16,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:36:16,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:36:16,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:36:16,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:36:16,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:36:16,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:36:16,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:36:16,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:36:16,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:36:16,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:36:16,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:36:16,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:36:16,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:36:16,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:36:16,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:36:16,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:36:16,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:36:16,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:36:16,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:36:16,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:36:16,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:36:16,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:36:16,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:36:16,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:36:16,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:36:16,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:36:16,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:36:16,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:36:16,285 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:36:16,286 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:36:16,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_power.opt.i [2019-12-18 21:36:16,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5a8423/c6f9be9d6424490face764e36bd44a46/FLAG57e653e89 [2019-12-18 21:36:16,898 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:36:16,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_power.opt.i [2019-12-18 21:36:16,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5a8423/c6f9be9d6424490face764e36bd44a46/FLAG57e653e89 [2019-12-18 21:36:17,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b5a8423/c6f9be9d6424490face764e36bd44a46 [2019-12-18 21:36:17,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:36:17,202 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:36:17,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:17,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:36:17,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:36:17,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:17,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f27377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17, skipping insertion in model container [2019-12-18 21:36:17,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:17,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:36:17,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:36:17,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:17,843 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:36:17,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:17,974 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:36:17,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17 WrapperNode [2019-12-18 21:36:17,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:17,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:17,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:36:17,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:36:17,985 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:36:17" (1/1) ... [2019-12-18 21:36:18,005 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:36:17" (1/1) ... [2019-12-18 21:36:18,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:18,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:36:18,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:36:18,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:36:18,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (1/1) ... [2019-12-18 21:36:18,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:36:18,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:36:18,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:36:18,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:36:18,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (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:36:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:36:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:36:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:36:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:36:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:36:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:36:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:36:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:36:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:36:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:36:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:36:18,163 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:36:18,902 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:36:18,902 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:36:18,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:18 BoogieIcfgContainer [2019-12-18 21:36:18,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:36:18,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:36:18,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:36:18,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:36:18,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:36:17" (1/3) ... [2019-12-18 21:36:18,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174a2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:18, skipping insertion in model container [2019-12-18 21:36:18,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:17" (2/3) ... [2019-12-18 21:36:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174a2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:18, skipping insertion in model container [2019-12-18 21:36:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:18" (3/3) ... [2019-12-18 21:36:18,912 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_power.opt.i [2019-12-18 21:36:18,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:36:18,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:36:18,929 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:36:18,930 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:36:18,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,042 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:19,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:36:19,109 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:36:19,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:36:19,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:36:19,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:36:19,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:36:19,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:36:19,110 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:36:19,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:36:19,128 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:36:19,130 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:19,211 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:19,211 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:19,228 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:36:19,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:19,300 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:19,300 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:19,312 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:36:19,340 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:36:19,342 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:36:22,854 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:36:22,966 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:36:23,003 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 21:36:23,003 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:36:23,007 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 21:36:23,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:36:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:36:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:36:23,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:23,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:36:23,464 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:36:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 21:36:23,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:23,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753893756] [2019-12-18 21:36:23,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:23,689 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:36:23,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753893756] [2019-12-18 21:36:23,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:23,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:36:23,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562803135] [2019-12-18 21:36:23,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:23,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:23,715 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:36:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:23,994 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 21:36:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:23,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:36:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:24,088 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 21:36:24,088 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 21:36:24,090 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:36:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 21:36:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 21:36:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 21:36:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 21:36:24,551 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 21:36:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:24,552 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 21:36:24,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 21:36:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:36:24,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:24,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:24,556 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:36:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 21:36:24,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:24,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287805323] [2019-12-18 21:36:24,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:24,674 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:36:24,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287805323] [2019-12-18 21:36:24,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:24,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:24,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389389514] [2019-12-18 21:36:24,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:24,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:24,678 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 21:36:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:25,211 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-18 21:36:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:25,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:36:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:25,298 INFO L225 Difference]: With dead ends: 11318 [2019-12-18 21:36:25,298 INFO L226 Difference]: Without dead ends: 11311 [2019-12-18 21:36:25,300 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:36:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-18 21:36:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-18 21:36:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-18 21:36:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-18 21:36:26,421 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-18 21:36:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:26,422 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-18 21:36:26,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-18 21:36:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:36:26,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:26,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:26,432 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:36:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 21:36:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32369231] [2019-12-18 21:36:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:26,575 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:36:26,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32369231] [2019-12-18 21:36:26,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:26,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:26,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031703203] [2019-12-18 21:36:26,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:26,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:26,578 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-18 21:36:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:26,927 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-18 21:36:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:36:26,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:36:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:26,986 INFO L225 Difference]: With dead ends: 14191 [2019-12-18 21:36:26,986 INFO L226 Difference]: Without dead ends: 14191 [2019-12-18 21:36:26,987 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:36:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-18 21:36:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-18 21:36:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-18 21:36:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-18 21:36:27,535 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-18 21:36:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:27,539 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-18 21:36:27,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-18 21:36:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:36:27,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:27,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:27,544 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:36:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-18 21:36:27,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:27,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637097137] [2019-12-18 21:36:27,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:27,644 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:36:27,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637097137] [2019-12-18 21:36:27,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:27,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:27,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981320190] [2019-12-18 21:36:27,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:27,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:27,647 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 4 states. [2019-12-18 21:36:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:27,682 INFO L93 Difference]: Finished difference Result 2163 states and 5380 transitions. [2019-12-18 21:36:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:36:27,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:36:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:27,687 INFO L225 Difference]: With dead ends: 2163 [2019-12-18 21:36:27,687 INFO L226 Difference]: Without dead ends: 1539 [2019-12-18 21:36:27,688 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:36:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-18 21:36:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-12-18 21:36:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-18 21:36:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-18 21:36:27,723 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 16 [2019-12-18 21:36:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:27,723 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-18 21:36:27,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-18 21:36:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:36:27,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:27,725 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:36:27,726 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:36:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 21:36:27,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:27,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415198212] [2019-12-18 21:36:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:27,871 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:36:27,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415198212] [2019-12-18 21:36:27,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:27,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:36:27,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767548021] [2019-12-18 21:36:27,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:27,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:27,874 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-18 21:36:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:28,340 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-18 21:36:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:36:28,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:36:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:28,357 INFO L225 Difference]: With dead ends: 2313 [2019-12-18 21:36:28,357 INFO L226 Difference]: Without dead ends: 2260 [2019-12-18 21:36:28,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:36:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-18 21:36:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-18 21:36:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-18 21:36:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-18 21:36:28,397 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-18 21:36:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:28,397 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-18 21:36:28,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-18 21:36:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:36:28,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:28,400 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:36:28,400 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:36:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-18 21:36:28,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:28,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460152061] [2019-12-18 21:36:28,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:28,520 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:36:28,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460152061] [2019-12-18 21:36:28,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:28,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:28,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461464354] [2019-12-18 21:36:28,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:28,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:28,522 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 5 states. [2019-12-18 21:36:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:28,976 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-18 21:36:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:28,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:36:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:28,984 INFO L225 Difference]: With dead ends: 2343 [2019-12-18 21:36:28,984 INFO L226 Difference]: Without dead ends: 2343 [2019-12-18 21:36:28,984 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:36:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-18 21:36:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-18 21:36:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-18 21:36:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-18 21:36:29,024 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-18 21:36:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:29,024 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-18 21:36:29,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-18 21:36:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:36:29,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:29,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:29,027 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:36:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-18 21:36:29,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:29,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607946523] [2019-12-18 21:36:29,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:29,118 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:36:29,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607946523] [2019-12-18 21:36:29,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:29,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:36:29,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813295875] [2019-12-18 21:36:29,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:29,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:29,121 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 5 states. [2019-12-18 21:36:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:29,170 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-18 21:36:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:29,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:36:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:29,173 INFO L225 Difference]: With dead ends: 1263 [2019-12-18 21:36:29,173 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 21:36:29,174 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:36:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 21:36:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-18 21:36:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-18 21:36:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-18 21:36:29,213 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-18 21:36:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:29,214 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-18 21:36:29,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-18 21:36:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:36:29,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:29,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:29,222 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:36:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-18 21:36:29,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:29,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554467854] [2019-12-18 21:36:29,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:29,364 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:36:29,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554467854] [2019-12-18 21:36:29,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:29,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:29,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942439051] [2019-12-18 21:36:29,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:36:29,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:36:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:29,367 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-18 21:36:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:29,681 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-18 21:36:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:36:29,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:36:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:29,685 INFO L225 Difference]: With dead ends: 3013 [2019-12-18 21:36:29,686 INFO L226 Difference]: Without dead ends: 2064 [2019-12-18 21:36:29,686 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:36:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-18 21:36:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-18 21:36:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 21:36:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-18 21:36:29,711 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-18 21:36:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:29,712 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-18 21:36:29,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:36:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-18 21:36:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:36:29,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:29,715 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:36:29,715 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:36:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-18 21:36:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140212157] [2019-12-18 21:36:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:29,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140212157] [2019-12-18 21:36:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:29,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:29,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245618483] [2019-12-18 21:36:29,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:29,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:29,792 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-18 21:36:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:29,813 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-18 21:36:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:36:29,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-18 21:36:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:29,816 INFO L225 Difference]: With dead ends: 1851 [2019-12-18 21:36:29,817 INFO L226 Difference]: Without dead ends: 818 [2019-12-18 21:36:29,817 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:36:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-18 21:36:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-18 21:36:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-18 21:36:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-18 21:36:29,831 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-18 21:36:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:29,831 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-18 21:36:29,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-18 21:36:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:36:29,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:29,835 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:36:29,835 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:36:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-18 21:36:29,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:29,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412031918] [2019-12-18 21:36:29,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:29,928 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:36:29,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412031918] [2019-12-18 21:36:29,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:29,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:29,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196439403] [2019-12-18 21:36:29,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:36:29,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:29,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:36:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:29,931 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 7 states. [2019-12-18 21:36:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:30,100 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-18 21:36:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:36:30,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:36:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:30,102 INFO L225 Difference]: With dead ends: 1396 [2019-12-18 21:36:30,102 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 21:36:30,103 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:36:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 21:36:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-18 21:36:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-18 21:36:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-18 21:36:30,118 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-18 21:36:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:30,118 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-18 21:36:30,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:36:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-18 21:36:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:36:30,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:30,121 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:36:30,121 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:36:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-18 21:36:30,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:30,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219821058] [2019-12-18 21:36:30,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:30,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:36:30,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219821058] [2019-12-18 21:36:30,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:30,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:30,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468106699] [2019-12-18 21:36:30,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:30,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:30,239 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-18 21:36:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:30,299 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-18 21:36:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:30,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:36:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:30,303 INFO L225 Difference]: With dead ends: 1036 [2019-12-18 21:36:30,304 INFO L226 Difference]: Without dead ends: 1036 [2019-12-18 21:36:30,304 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:36:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-18 21:36:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-18 21:36:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 21:36:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-18 21:36:30,323 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-18 21:36:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:30,323 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-18 21:36:30,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-18 21:36:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:30,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:30,326 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:36:30,327 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:36:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-18 21:36:30,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:30,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665899549] [2019-12-18 21:36:30,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:30,494 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:36:30,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665899549] [2019-12-18 21:36:30,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:30,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:30,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237770986] [2019-12-18 21:36:30,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:30,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:30,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:30,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:30,496 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 6 states. [2019-12-18 21:36:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:30,955 INFO L93 Difference]: Finished difference Result 993 states and 2070 transitions. [2019-12-18 21:36:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:36:30,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:36:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:30,957 INFO L225 Difference]: With dead ends: 993 [2019-12-18 21:36:30,957 INFO L226 Difference]: Without dead ends: 993 [2019-12-18 21:36:30,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 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:36:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-18 21:36:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 900. [2019-12-18 21:36:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-18 21:36:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1900 transitions. [2019-12-18 21:36:30,976 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1900 transitions. Word has length 52 [2019-12-18 21:36:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:30,976 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1900 transitions. [2019-12-18 21:36:30,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1900 transitions. [2019-12-18 21:36:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:30,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:30,979 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:36:30,979 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:36:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-18 21:36:30,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:30,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328693050] [2019-12-18 21:36:30,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:31,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328693050] [2019-12-18 21:36:31,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:31,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:31,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874807278] [2019-12-18 21:36:31,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:31,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:31,109 INFO L87 Difference]: Start difference. First operand 900 states and 1900 transitions. Second operand 3 states. [2019-12-18 21:36:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:31,121 INFO L93 Difference]: Finished difference Result 899 states and 1898 transitions. [2019-12-18 21:36:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:31,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:36:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:31,124 INFO L225 Difference]: With dead ends: 899 [2019-12-18 21:36:31,124 INFO L226 Difference]: Without dead ends: 899 [2019-12-18 21:36:31,124 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:36:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-18 21:36:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 743. [2019-12-18 21:36:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 21:36:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-18 21:36:31,139 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-18 21:36:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:31,139 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-18 21:36:31,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-18 21:36:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:36:31,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:31,142 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:36:31,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 21:36:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355864897] [2019-12-18 21:36:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:31,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:36:31,285 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:36:31,289 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) (= 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) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1283~0.base_24| 4) |v_#length_17|) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1283~0.base_24|) (= 0 v_~y$r_buff1_thd0~0_25) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1283~0.base_24| 1)) (= 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_~y$w_buff0_used~0_106 0) (= |v_ULTIMATE.start_main_~#t1283~0.offset_19| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1283~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1283~0.base_24|) |v_ULTIMATE.start_main_~#t1283~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_25) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1283~0.base_24|)) (= 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_~#t1283~0.base=|v_ULTIMATE.start_main_~#t1283~0.base_24|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, 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_~#t1283~0.offset=|v_ULTIMATE.start_main_~#t1283~0.offset_19|, 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, ~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|, ~y~0=v_~y~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t1284~0.base=|v_ULTIMATE.start_main_~#t1284~0.base_25|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ULTIMATE.start_main_~#t1284~0.offset=|v_ULTIMATE.start_main_~#t1284~0.offset_19|, ~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_~#t1283~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1283~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~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, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1284~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1284~0.offset, ~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:36:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1284~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1284~0.base_13|) |v_ULTIMATE.start_main_~#t1284~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1284~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1284~0.base_13| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1284~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1284~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1284~0.base_13|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1284~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_~#t1284~0.offset=|v_ULTIMATE.start_main_~#t1284~0.offset_11|, #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_~#t1284~0.base=|v_ULTIMATE.start_main_~#t1284~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1284~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1284~0.base] because there is no mapped edge [2019-12-18 21:36:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-375070668 0)) (= ~x~0_In-375070668 ~__unbuffered_p0_EAX~0_Out-375070668) (= ~y$r_buff1_thd2~0_Out-375070668 ~y$r_buff0_thd2~0_In-375070668) (= ~y$r_buff1_thd0~0_Out-375070668 ~y$r_buff0_thd0~0_In-375070668) (= 1 ~y$r_buff0_thd1~0_Out-375070668) (= ~y$r_buff1_thd1~0_Out-375070668 ~y$r_buff0_thd1~0_In-375070668)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-375070668, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-375070668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-375070668, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-375070668, ~x~0=~x~0_In-375070668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-375070668, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-375070668, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-375070668, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-375070668, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-375070668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-375070668, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-375070668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-375070668, ~x~0=~x~0_In-375070668} 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:36:31,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2078220615 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In2078220615 256) 0))) (or (and (= ~y$w_buff0_used~0_In2078220615 |P0Thread1of1ForFork0_#t~ite5_Out2078220615|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2078220615|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2078220615, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2078220615} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2078220615|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078220615, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2078220615} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:36:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1298642791 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-1298642791 |P1Thread1of1ForFork1_#t~ite21_Out-1298642791|) (= |P1Thread1of1ForFork1_#t~ite20_In-1298642791| |P1Thread1of1ForFork1_#t~ite20_Out-1298642791|)) (and (= ~y$w_buff0_used~0_In-1298642791 |P1Thread1of1ForFork1_#t~ite20_Out-1298642791|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1298642791 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1298642791 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1298642791 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1298642791 256))))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1298642791| |P1Thread1of1ForFork1_#t~ite20_Out-1298642791|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1298642791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1298642791, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1298642791|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1298642791, ~weak$$choice2~0=~weak$$choice2~0_In-1298642791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1298642791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1298642791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1298642791, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1298642791|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1298642791, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1298642791|, ~weak$$choice2~0=~weak$$choice2~0_In-1298642791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1298642791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:36:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-578918398 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-578918398 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-578918398 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In-578918398 256) 0)) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out-578918398| |P1Thread1of1ForFork1_#t~ite23_Out-578918398|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-578918398 256)))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) (= |P1Thread1of1ForFork1_#t~ite22_Out-578918398| |P1Thread1of1ForFork1_#t~ite23_Out-578918398|) (= |P1Thread1of1ForFork1_#t~ite22_Out-578918398| 0) .cse3 .cse4 (not .cse5))) (and (or (and (or (and .cse6 .cse2) (and .cse6 .cse1) .cse5) (= ~y$w_buff1_used~0_In-578918398 |P1Thread1of1ForFork1_#t~ite23_Out-578918398|) .cse3 .cse4) (and (not .cse3) (= |P1Thread1of1ForFork1_#t~ite23_In-578918398| |P1Thread1of1ForFork1_#t~ite23_Out-578918398|) (= |P1Thread1of1ForFork1_#t~ite24_Out-578918398| ~y$w_buff1_used~0_In-578918398))) (= |P1Thread1of1ForFork1_#t~ite22_In-578918398| |P1Thread1of1ForFork1_#t~ite22_Out-578918398|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-578918398, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-578918398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-578918398, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-578918398|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-578918398|, ~weak$$choice2~0=~weak$$choice2~0_In-578918398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-578918398} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-578918398, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-578918398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-578918398, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-578918398|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-578918398|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-578918398|, ~weak$$choice2~0=~weak$$choice2~0_In-578918398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-578918398} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:36:31,300 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:36:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1896577965 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1896577965 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1896577965 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1896577965 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1896577965|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1896577965| ~y$w_buff1_used~0_In-1896577965) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1896577965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1896577965, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1896577965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1896577965} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1896577965|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1896577965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1896577965, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1896577965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1896577965} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:36:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In571685747 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In571685747 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out571685747 ~y$r_buff0_thd1~0_In571685747) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out571685747 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In571685747, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In571685747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In571685747, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out571685747|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out571685747} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:36:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse4 (= (mod ~y$w_buff1_used~0_In-670149840 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-670149840 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-670149840 256))) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-670149840 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out-670149840| |P1Thread1of1ForFork1_#t~ite29_Out-670149840|)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-670149840 256)))) (or (and (or (and (= ~y$r_buff1_thd2~0_In-670149840 |P1Thread1of1ForFork1_#t~ite29_Out-670149840|) .cse0 .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse3))) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-670149840 |P1Thread1of1ForFork1_#t~ite30_Out-670149840|) (= |P1Thread1of1ForFork1_#t~ite29_In-670149840| |P1Thread1of1ForFork1_#t~ite29_Out-670149840|))) (= |P1Thread1of1ForFork1_#t~ite28_In-670149840| |P1Thread1of1ForFork1_#t~ite28_Out-670149840|)) (let ((.cse6 (not .cse3))) (and (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite28_Out-670149840| |P1Thread1of1ForFork1_#t~ite29_Out-670149840|) (not .cse2) .cse0 (or (not .cse5) .cse6) .cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out-670149840| 0))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-670149840, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-670149840|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-670149840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-670149840, ~weak$$choice2~0=~weak$$choice2~0_In-670149840, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-670149840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-670149840} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-670149840, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-670149840|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-670149840|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-670149840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-670149840, ~weak$$choice2~0=~weak$$choice2~0_In-670149840, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-670149840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-670149840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:36:31,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-736027170 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-736027170 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-736027170 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-736027170 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-736027170| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-736027170| ~y$r_buff1_thd1~0_In-736027170) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-736027170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-736027170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-736027170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-736027170} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-736027170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-736027170, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-736027170|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-736027170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-736027170} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:36:31,302 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:36:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In340044022 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In340044022 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In340044022 |P1Thread1of1ForFork1_#t~ite32_Out340044022|)) (and (= ~y$w_buff1~0_In340044022 |P1Thread1of1ForFork1_#t~ite32_Out340044022|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In340044022, ~y$w_buff1~0=~y$w_buff1~0_In340044022, ~y~0=~y~0_In340044022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In340044022} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In340044022, ~y$w_buff1~0=~y$w_buff1~0_In340044022, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out340044022|, ~y~0=~y~0_In340044022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In340044022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:36:31,303 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:36:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2004918557 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2004918557 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2004918557| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out2004918557| ~y$w_buff0_used~0_In2004918557) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2004918557, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004918557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2004918557, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004918557, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2004918557|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:36:31,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1136055143 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1136055143 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1136055143 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1136055143 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1136055143| ~y$w_buff1_used~0_In-1136055143) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1136055143| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1136055143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136055143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1136055143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1136055143} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1136055143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136055143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1136055143, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1136055143|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1136055143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:36:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1661823174 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1661823174 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1661823174| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1661823174 |P1Thread1of1ForFork1_#t~ite36_Out1661823174|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1661823174, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661823174} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1661823174, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661823174, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1661823174|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:36:31,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1237143204 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1237143204 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1237143204 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1237143204 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1237143204|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-1237143204 |P1Thread1of1ForFork1_#t~ite37_Out-1237143204|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237143204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1237143204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1237143204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237143204} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237143204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1237143204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1237143204, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1237143204|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237143204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:36:31,306 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:36:31,306 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:36:31,307 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:36:31,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In664095042 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In664095042 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out664095042| ~y~0_In664095042)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out664095042| ~y$w_buff1~0_In664095042) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In664095042, ~y~0=~y~0_In664095042, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664095042, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664095042} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out664095042|, ~y$w_buff1~0=~y$w_buff1~0_In664095042, ~y~0=~y~0_In664095042, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664095042, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664095042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:36:31,308 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:36:31,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In955716435 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In955716435 256)))) (or (and (= ~y$w_buff0_used~0_In955716435 |ULTIMATE.start_main_#t~ite42_Out955716435|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out955716435|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In955716435, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In955716435} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In955716435, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In955716435, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out955716435|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:36:31,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1953356503 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1953356503 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1953356503 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1953356503 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1953356503| ~y$w_buff1_used~0_In1953356503) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out1953356503| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1953356503, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1953356503, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1953356503, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1953356503} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1953356503, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1953356503, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1953356503|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1953356503, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1953356503} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:36:31,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1849618149 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1849618149 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1849618149 |ULTIMATE.start_main_#t~ite44_Out-1849618149|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1849618149|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849618149, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849618149} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849618149, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849618149, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1849618149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:36:31,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1135799313 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1135799313 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1135799313 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1135799313 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1135799313|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1135799313 |ULTIMATE.start_main_#t~ite45_Out1135799313|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1135799313, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1135799313, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1135799313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1135799313} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1135799313, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1135799313, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1135799313, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1135799313|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1135799313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:36:31,311 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:36:31,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:36:31 BasicIcfg [2019-12-18 21:36:31,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:36:31,411 INFO L168 Benchmark]: Toolchain (without parser) took 14207.52 ms. Allocated memory was 145.2 MB in the beginning and 588.8 MB in the end (delta: 443.5 MB). Free memory was 101.9 MB in the beginning and 382.7 MB in the end (delta: -280.9 MB). Peak memory consumption was 162.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,412 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.05 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 156.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.11 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,417 INFO L168 Benchmark]: Boogie Preprocessor took 63.43 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.7 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:36:31,418 INFO L168 Benchmark]: RCFGBuilder took 796.24 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 107.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,420 INFO L168 Benchmark]: TraceAbstraction took 12502.67 ms. Allocated memory was 201.9 MB in the beginning and 588.8 MB in the end (delta: 386.9 MB). Free memory was 107.1 MB in the beginning and 382.7 MB in the end (delta: -275.7 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:31,424 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.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.05 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 156.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.11 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.43 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.24 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 107.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12502.67 ms. Allocated memory was 201.9 MB in the beginning and 588.8 MB in the end (delta: 386.9 MB). Free memory was 107.1 MB in the beginning and 382.7 MB in the end (delta: -275.7 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 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(&t1283, ((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(&t1284, ((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: 12.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1855 SDslu, 3506 SDs, 0 SdLazy, 1852 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 6943 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 50459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...