/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:52:21,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:52:21,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:52:21,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:52:21,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:52:21,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:52:21,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:52:21,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:52:21,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:52:21,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:52:21,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:52:21,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:52:21,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:52:21,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:52:21,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:52:21,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:52:21,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:52:21,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:52:21,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:52:21,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:52:21,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:52:21,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:52:21,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:52:21,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:52:21,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:52:21,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:52:21,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:52:21,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:52:21,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:52:21,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:52:21,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:52:21,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:52:21,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:52:21,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:52:21,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:52:21,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:52:21,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:52:21,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:52:21,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:52:21,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:52:21,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:52:21,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:52:21,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:52:21,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:52:21,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:52:21,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:52:21,892 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:52:21,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:52:21,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:52:21,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:52:21,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:52:21,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:52:21,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:52:21,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:52:21,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:52:21,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:52:21,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:52:21,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:52:21,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:52:21,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:52:21,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:52:21,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:52:21,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:52:21,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:52:21,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:52:21,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:52:21,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:52:22,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:52:22,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:52:22,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:52:22,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:52:22,196 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:52:22,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-18 13:52:22,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c552581c3/3254570b70114ef9bb4ec0df6db22706/FLAG61a0fe996 [2019-12-18 13:52:22,927 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:52:22,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-18 13:52:22,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c552581c3/3254570b70114ef9bb4ec0df6db22706/FLAG61a0fe996 [2019-12-18 13:52:23,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c552581c3/3254570b70114ef9bb4ec0df6db22706 [2019-12-18 13:52:23,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:52:23,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:52:23,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:52:23,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:52:23,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:52:23,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:23,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23, skipping insertion in model container [2019-12-18 13:52:23,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:23,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:52:23,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:52:23,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:52:23,771 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:52:23,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:52:23,936 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:52:23,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23 WrapperNode [2019-12-18 13:52:23,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:52:23,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:52:23,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:52:23,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:52:23,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:23,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:23,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:52:23,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:52:23,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:52:23,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:52:24,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (1/1) ... [2019-12-18 13:52:24,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:52:24,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:52:24,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:52:24,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:52:24,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (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 13:52:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:52:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:52:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:52:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:52:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:52:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:52:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:52:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:52:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:52:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:52:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:52:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:52:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:52:24,122 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 13:52:24,994 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:52:24,994 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:52:24,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:52:24 BoogieIcfgContainer [2019-12-18 13:52:24,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:52:24,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:52:24,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:52:25,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:52:25,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:52:23" (1/3) ... [2019-12-18 13:52:25,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:52:25, skipping insertion in model container [2019-12-18 13:52:25,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:23" (2/3) ... [2019-12-18 13:52:25,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:52:25, skipping insertion in model container [2019-12-18 13:52:25,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:52:24" (3/3) ... [2019-12-18 13:52:25,008 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.oepc.i [2019-12-18 13:52:25,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:52:25,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:52:25,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:52:25,026 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:52:25,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,148 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:25,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:52:25,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:52:25,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:52:25,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:52:25,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:52:25,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:52:25,190 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:52:25,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:52:25,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:52:25,213 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:52:25,215 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:52:25,317 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:52:25,317 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:52:25,341 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:52:25,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:52:25,432 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:52:25,432 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:52:25,440 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:52:25,462 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:52:25,463 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:52:31,213 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:52:31,334 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:52:31,709 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 13:52:31,709 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:52:31,715 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:52:50,594 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 13:52:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 13:52:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:52:50,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:52:50,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:52:50,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:52:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:52:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 13:52:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:52:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 13:52:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:52:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:52:50,811 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 13:52:50,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 13:52:50,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:52:50,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:52:50,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931707045] [2019-12-18 13:52:50,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:52:50,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:52:50,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:52:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:52:50,832 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 13:52:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:52:54,540 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 13:52:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:52:54,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:52:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:52:55,141 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 13:52:55,141 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 13:52:55,142 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 13:52:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 13:53:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 13:53:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 13:53:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 13:53:01,505 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 13:53:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:01,506 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 13:53:01,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 13:53:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:53:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:01,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:01,511 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 13:53:01,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:01,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 13:53:01,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:01,630 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 13:53:01,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 13:53:01,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:01,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:01,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994682901] [2019-12-18 13:53:01,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:01,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:01,634 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 13:53:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:06,194 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 13:53:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:53:06,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:53:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:07,532 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 13:53:07,533 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 13:53:07,539 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 13:53:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 13:53:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 13:53:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 13:53:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 13:53:20,185 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 13:53:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:20,185 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 13:53:20,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 13:53:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:53:20,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:20,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:20,194 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 13:53:20,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:20,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 13:53:20,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:20,261 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 13:53:20,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 13:53:20,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:20,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:20,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595505515] [2019-12-18 13:53:20,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:20,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:20,263 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 13:53:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:20,395 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 13:53:20,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:20,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:53:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:20,467 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 13:53:20,467 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 13:53:20,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 13:53:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 13:53:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 13:53:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 13:53:21,066 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 13:53:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:21,066 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 13:53:21,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 13:53:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:53:21,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:21,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:21,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:21,070 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 13:53:21,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:21,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 13:53:21,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:21,174 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 13:53:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 13:53:21,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:21,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:21,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213687615] [2019-12-18 13:53:21,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:21,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:21,176 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 13:53:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:22,760 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 13:53:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:53:22,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:53:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:22,829 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 13:53:22,829 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 13:53:22,830 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 13:53:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 13:53:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 13:53:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 13:53:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 13:53:23,504 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 13:53:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 13:53:23,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 13:53:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:53:23,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:23,516 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] [2019-12-18 13:53:23,516 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 13:53:23,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:23,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 13:53:23,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:23,636 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 13:53:23,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 13:53:23,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:23,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:23,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790839240] [2019-12-18 13:53:23,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:23,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:23,639 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 13:53:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:26,697 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 13:53:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:53:26,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:53:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:26,790 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 13:53:26,791 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 13:53:26,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:53:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 13:53:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 13:53:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 13:53:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 13:53:27,525 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 13:53:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:27,525 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 13:53:27,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 13:53:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:53:27,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:27,540 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 13:53:27,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 13:53:27,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:27,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 13:53:27,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:27,613 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 13:53:27,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 13:53:27,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:27,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:27,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476794899] [2019-12-18 13:53:27,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:27,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:27,616 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 13:53:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:27,685 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 13:53:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:27,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:53:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:27,706 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 13:53:27,707 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 13:53:27,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 13:53:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 13:53:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 13:53:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 13:53:27,927 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 13:53:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:27,928 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 13:53:27,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 13:53:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:53:27,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:27,939 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 13:53:27,939 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 13:53:27,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:27,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226242017] [2019-12-18 13:53:27,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:28,031 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 13:53:28,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226242017] [2019-12-18 13:53:28,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:28,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:28,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070569366] [2019-12-18 13:53:28,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:28,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:28,034 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 13:53:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:28,725 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 13:53:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:53:28,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:53:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:28,757 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 13:53:28,757 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 13:53:28,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:53:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 13:53:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 13:53:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 13:53:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 13:53:29,045 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 13:53:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:29,045 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 13:53:29,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 13:53:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:53:29,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:29,063 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] [2019-12-18 13:53:29,063 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 13:53:29,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:29,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127271803] [2019-12-18 13:53:29,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:29,165 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 13:53:29,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127271803] [2019-12-18 13:53:29,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:29,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:29,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383325518] [2019-12-18 13:53:29,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:29,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:29,167 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 13:53:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:30,423 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 13:53:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:53:30,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:53:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:30,461 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 13:53:30,461 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 13:53:30,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:53:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 13:53:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 13:53:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 13:53:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 13:53:30,756 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 13:53:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:30,756 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 13:53:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 13:53:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:53:30,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:30,778 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] [2019-12-18 13:53:30,779 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 13:53:30,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:30,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386791657] [2019-12-18 13:53:30,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:30,867 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 13:53:30,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386791657] [2019-12-18 13:53:30,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:30,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:30,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558399900] [2019-12-18 13:53:30,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:30,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:30,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:30,869 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-18 13:53:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:31,544 INFO L93 Difference]: Finished difference Result 23224 states and 69393 transitions. [2019-12-18 13:53:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:53:31,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:53:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:31,576 INFO L225 Difference]: With dead ends: 23224 [2019-12-18 13:53:31,576 INFO L226 Difference]: Without dead ends: 23224 [2019-12-18 13:53:31,577 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 13:53:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23224 states. [2019-12-18 13:53:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23224 to 21703. [2019-12-18 13:53:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21703 states. [2019-12-18 13:53:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21703 states to 21703 states and 65239 transitions. [2019-12-18 13:53:32,036 INFO L78 Accepts]: Start accepts. Automaton has 21703 states and 65239 transitions. Word has length 39 [2019-12-18 13:53:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:32,036 INFO L462 AbstractCegarLoop]: Abstraction has 21703 states and 65239 transitions. [2019-12-18 13:53:32,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21703 states and 65239 transitions. [2019-12-18 13:53:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:53:32,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:32,063 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] [2019-12-18 13:53:32,063 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 2 times [2019-12-18 13:53:32,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:32,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279572670] [2019-12-18 13:53:32,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:32,157 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 13:53:32,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279572670] [2019-12-18 13:53:32,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:32,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:32,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4881463] [2019-12-18 13:53:32,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:32,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:32,161 INFO L87 Difference]: Start difference. First operand 21703 states and 65239 transitions. Second operand 5 states. [2019-12-18 13:53:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:32,281 INFO L93 Difference]: Finished difference Result 20476 states and 62395 transitions. [2019-12-18 13:53:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:53:32,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:53:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:32,321 INFO L225 Difference]: With dead ends: 20476 [2019-12-18 13:53:32,321 INFO L226 Difference]: Without dead ends: 20476 [2019-12-18 13:53:32,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2019-12-18 13:53:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19636. [2019-12-18 13:53:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19636 states. [2019-12-18 13:53:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19636 states to 19636 states and 60128 transitions. [2019-12-18 13:53:32,758 INFO L78 Accepts]: Start accepts. Automaton has 19636 states and 60128 transitions. Word has length 39 [2019-12-18 13:53:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:32,759 INFO L462 AbstractCegarLoop]: Abstraction has 19636 states and 60128 transitions. [2019-12-18 13:53:32,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19636 states and 60128 transitions. [2019-12-18 13:53:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:32,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:32,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:32,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-18 13:53:32,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:32,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477068772] [2019-12-18 13:53:32,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:32,831 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 13:53:32,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477068772] [2019-12-18 13:53:32,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:32,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:32,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080885982] [2019-12-18 13:53:32,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:32,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:32,833 INFO L87 Difference]: Start difference. First operand 19636 states and 60128 transitions. Second operand 3 states. [2019-12-18 13:53:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:32,962 INFO L93 Difference]: Finished difference Result 29371 states and 90040 transitions. [2019-12-18 13:53:32,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:32,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:53:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:33,001 INFO L225 Difference]: With dead ends: 29371 [2019-12-18 13:53:33,001 INFO L226 Difference]: Without dead ends: 29371 [2019-12-18 13:53:33,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29371 states. [2019-12-18 13:53:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29371 to 22257. [2019-12-18 13:53:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-18 13:53:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68986 transitions. [2019-12-18 13:53:33,371 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68986 transitions. Word has length 64 [2019-12-18 13:53:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:33,371 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68986 transitions. [2019-12-18 13:53:33,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68986 transitions. [2019-12-18 13:53:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:33,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:33,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:33,582 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-18 13:53:33,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:33,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244845331] [2019-12-18 13:53:33,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:33,708 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 13:53:33,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244845331] [2019-12-18 13:53:33,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:33,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:33,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974445166] [2019-12-18 13:53:33,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:33,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:33,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:33,710 INFO L87 Difference]: Start difference. First operand 22257 states and 68986 transitions. Second operand 4 states. [2019-12-18 13:53:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:33,878 INFO L93 Difference]: Finished difference Result 41807 states and 129823 transitions. [2019-12-18 13:53:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:33,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 13:53:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:33,909 INFO L225 Difference]: With dead ends: 41807 [2019-12-18 13:53:33,909 INFO L226 Difference]: Without dead ends: 20833 [2019-12-18 13:53:33,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:53:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-18 13:53:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 20833. [2019-12-18 13:53:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 13:53:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 13:53:34,241 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 13:53:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:34,241 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 13:53:34,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 13:53:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:34,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:34,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:34,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-18 13:53:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589934128] [2019-12-18 13:53:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:34,360 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 13:53:34,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589934128] [2019-12-18 13:53:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:34,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263430070] [2019-12-18 13:53:34,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:34,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:34,363 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 13:53:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:34,900 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 13:53:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:53:34,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:34,976 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 13:53:34,976 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 13:53:34,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:53:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 13:53:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 13:53:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 13:53:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 13:53:35,472 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 13:53:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:35,473 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 13:53:35,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 13:53:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:35,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:35,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:35,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-18 13:53:35,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:35,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742417546] [2019-12-18 13:53:35,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:35,587 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 13:53:35,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742417546] [2019-12-18 13:53:35,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:35,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:35,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640860191] [2019-12-18 13:53:35,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:35,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:35,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:35,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:35,590 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 13:53:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:36,242 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 13:53:36,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:53:36,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:36,322 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 13:53:36,322 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 13:53:36,323 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 13:53:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 13:53:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 13:53:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 13:53:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 13:53:36,923 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 13:53:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:36,923 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 13:53:36,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 13:53:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:36,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:36,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:36,952 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 4 times [2019-12-18 13:53:36,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:36,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627042458] [2019-12-18 13:53:36,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:37,029 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 13:53:37,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627042458] [2019-12-18 13:53:37,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:37,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:37,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394568438] [2019-12-18 13:53:37,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:37,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:37,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:37,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:37,031 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 13:53:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:37,618 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 13:53:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:53:37,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:37,729 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 13:53:37,729 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 13:53:37,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:53:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 13:53:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 13:53:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 13:53:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 13:53:38,652 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 13:53:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:38,652 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 13:53:38,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 13:53:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:38,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:38,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:38,684 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-18 13:53:38,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:38,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725336924] [2019-12-18 13:53:38,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:38,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725336924] [2019-12-18 13:53:38,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:38,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:38,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940519656] [2019-12-18 13:53:38,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:38,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:38,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:38,749 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 13:53:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:38,913 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 13:53:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:38,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:53:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:38,961 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 13:53:38,961 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 13:53:38,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:53:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 13:53:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 13:53:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 13:53:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 13:53:39,444 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 13:53:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:39,444 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 13:53:39,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 13:53:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:39,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:39,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:39,476 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 13:53:39,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:39,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856376140] [2019-12-18 13:53:39,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:39,535 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 13:53:39,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856376140] [2019-12-18 13:53:39,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:39,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:39,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525830259] [2019-12-18 13:53:39,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:39,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:39,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:39,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:39,537 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 13:53:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:39,884 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 13:53:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:53:39,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:53:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:39,954 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 13:53:39,955 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 13:53:39,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:53:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 13:53:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 13:53:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 13:53:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 13:53:40,791 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 13:53:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:40,792 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 13:53:40,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 13:53:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:40,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:40,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:40,828 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 13:53:40,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:40,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231788303] [2019-12-18 13:53:40,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:40,904 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 13:53:40,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231788303] [2019-12-18 13:53:40,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:40,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:40,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750970376] [2019-12-18 13:53:40,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:40,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:40,906 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 13:53:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:41,450 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 13:53:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:53:41,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:53:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:41,550 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 13:53:41,550 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 13:53:41,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:53:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 13:53:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 13:53:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 13:53:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 13:53:42,276 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 13:53:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:42,276 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 13:53:42,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 13:53:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:42,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:42,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:42,313 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 13:53:42,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:42,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252902709] [2019-12-18 13:53:42,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:42,424 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 13:53:42,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252902709] [2019-12-18 13:53:42,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:42,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:53:42,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218613346] [2019-12-18 13:53:42,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:42,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:42,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:42,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:42,425 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 13:53:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:43,435 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 13:53:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:53:43,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:53:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:43,499 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 13:53:43,500 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 13:53:43,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 13:53:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 13:53:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 13:53:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 13:53:44,082 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 13:53:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:44,083 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 13:53:44,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 13:53:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:44,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:44,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:44,119 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 13:53:44,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:44,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472131979] [2019-12-18 13:53:44,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:44,162 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 13:53:44,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472131979] [2019-12-18 13:53:44,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:44,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:44,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939169537] [2019-12-18 13:53:44,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:44,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:44,164 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 13:53:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:44,404 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 13:53:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:44,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:53:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:44,467 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 13:53:44,467 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 13:53:44,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 13:53:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 13:53:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 13:53:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 13:53:45,028 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 13:53:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:45,029 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 13:53:45,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 13:53:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:45,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:45,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:45,064 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 13:53:45,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:45,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623340550] [2019-12-18 13:53:45,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:45,169 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 13:53:45,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623340550] [2019-12-18 13:53:45,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:45,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:53:45,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79448307] [2019-12-18 13:53:45,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:45,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:45,171 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-18 13:53:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:46,301 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 13:53:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:53:46,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:53:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:46,378 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 13:53:46,378 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 13:53:46,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:53:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 13:53:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 13:53:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 13:53:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 13:53:47,035 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 13:53:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:47,035 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 13:53:47,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 13:53:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:47,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:47,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:47,087 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 13:53:47,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:47,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557474099] [2019-12-18 13:53:47,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:47,148 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 13:53:47,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557474099] [2019-12-18 13:53:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440601612] [2019-12-18 13:53:47,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:47,151 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 13:53:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:47,348 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 13:53:47,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:47,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:53:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:47,400 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 13:53:47,400 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 13:53:47,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:53:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 13:53:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 13:53:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 13:53:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 13:53:47,872 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 13:53:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 13:53:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 13:53:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:47,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:47,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:47,902 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 13:53:47,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:47,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875266880] [2019-12-18 13:53:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:48,001 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 13:53:48,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875266880] [2019-12-18 13:53:48,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:48,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:48,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522560885] [2019-12-18 13:53:48,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:48,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:48,004 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 13:53:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:48,662 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 13:53:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:53:48,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 13:53:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:48,752 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 13:53:48,752 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 13:53:48,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 13:53:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 13:53:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 13:53:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 13:53:49,941 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 13:53:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:49,941 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 13:53:49,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 13:53:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:49,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:49,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:49,991 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 13:53:49,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:49,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745178753] [2019-12-18 13:53:49,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:50,184 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 13:53:50,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745178753] [2019-12-18 13:53:50,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:50,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:53:50,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433562738] [2019-12-18 13:53:50,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:53:50,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:53:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:50,189 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 9 states. [2019-12-18 13:53:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:51,828 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-18 13:53:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:53:51,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:53:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:51,900 INFO L225 Difference]: With dead ends: 49096 [2019-12-18 13:53:51,900 INFO L226 Difference]: Without dead ends: 49000 [2019-12-18 13:53:51,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:53:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-18 13:53:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-18 13:53:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-18 13:53:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-18 13:53:52,520 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-18 13:53:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:52,521 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-18 13:53:52,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:53:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-18 13:53:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:52,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:52,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:52,558 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-18 13:53:52,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:52,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185480303] [2019-12-18 13:53:52,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:52,611 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 13:53:52,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185480303] [2019-12-18 13:53:52,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:52,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:52,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227123928] [2019-12-18 13:53:52,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:52,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:52,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:52,613 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 3 states. [2019-12-18 13:53:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:52,741 INFO L93 Difference]: Finished difference Result 25698 states and 77408 transitions. [2019-12-18 13:53:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:52,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:53:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:52,802 INFO L225 Difference]: With dead ends: 25698 [2019-12-18 13:53:52,802 INFO L226 Difference]: Without dead ends: 25698 [2019-12-18 13:53:52,802 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 13:53:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2019-12-18 13:53:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 24983. [2019-12-18 13:53:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24983 states. [2019-12-18 13:53:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24983 states to 24983 states and 75146 transitions. [2019-12-18 13:53:53,561 INFO L78 Accepts]: Start accepts. Automaton has 24983 states and 75146 transitions. Word has length 65 [2019-12-18 13:53:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:53,561 INFO L462 AbstractCegarLoop]: Abstraction has 24983 states and 75146 transitions. [2019-12-18 13:53:53,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 24983 states and 75146 transitions. [2019-12-18 13:53:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:53,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:53,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:53,597 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 587293515, now seen corresponding path program 1 times [2019-12-18 13:53:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745940804] [2019-12-18 13:53:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:53,735 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 13:53:53,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745940804] [2019-12-18 13:53:53,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:53,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:53:53,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107806285] [2019-12-18 13:53:53,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:53:53,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:53:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:53,738 INFO L87 Difference]: Start difference. First operand 24983 states and 75146 transitions. Second operand 9 states. [2019-12-18 13:53:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:56,425 INFO L93 Difference]: Finished difference Result 40033 states and 117848 transitions. [2019-12-18 13:53:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:53:56,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:53:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:56,477 INFO L225 Difference]: With dead ends: 40033 [2019-12-18 13:53:56,477 INFO L226 Difference]: Without dead ends: 39757 [2019-12-18 13:53:56,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 13:53:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39757 states. [2019-12-18 13:53:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39757 to 26779. [2019-12-18 13:53:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-18 13:53:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 80580 transitions. [2019-12-18 13:53:56,995 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 80580 transitions. Word has length 66 [2019-12-18 13:53:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:56,996 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 80580 transitions. [2019-12-18 13:53:56,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:53:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 80580 transitions. [2019-12-18 13:53:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:57,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:57,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:57,024 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash -810539447, now seen corresponding path program 2 times [2019-12-18 13:53:57,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:57,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071820871] [2019-12-18 13:53:57,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:57,137 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 13:53:57,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071820871] [2019-12-18 13:53:57,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:57,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:53:57,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063892149] [2019-12-18 13:53:57,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:53:57,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:53:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:57,139 INFO L87 Difference]: Start difference. First operand 26779 states and 80580 transitions. Second operand 9 states. [2019-12-18 13:53:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:58,784 INFO L93 Difference]: Finished difference Result 48323 states and 144026 transitions. [2019-12-18 13:53:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:53:58,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:53:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:58,833 INFO L225 Difference]: With dead ends: 48323 [2019-12-18 13:53:58,834 INFO L226 Difference]: Without dead ends: 37632 [2019-12-18 13:53:58,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:53:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37632 states. [2019-12-18 13:53:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37632 to 27358. [2019-12-18 13:53:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27358 states. [2019-12-18 13:53:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27358 states to 27358 states and 81748 transitions. [2019-12-18 13:53:59,331 INFO L78 Accepts]: Start accepts. Automaton has 27358 states and 81748 transitions. Word has length 66 [2019-12-18 13:53:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:59,331 INFO L462 AbstractCegarLoop]: Abstraction has 27358 states and 81748 transitions. [2019-12-18 13:53:59,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:53:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27358 states and 81748 transitions. [2019-12-18 13:53:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:59,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:59,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:59,360 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1630345305, now seen corresponding path program 3 times [2019-12-18 13:53:59,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:59,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634074918] [2019-12-18 13:53:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:59,506 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 13:53:59,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634074918] [2019-12-18 13:53:59,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:59,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:53:59,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569134544] [2019-12-18 13:53:59,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:53:59,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:53:59,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:53:59,508 INFO L87 Difference]: Start difference. First operand 27358 states and 81748 transitions. Second operand 11 states. [2019-12-18 13:54:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:00,803 INFO L93 Difference]: Finished difference Result 58699 states and 175154 transitions. [2019-12-18 13:54:00,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 13:54:00,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:54:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:00,869 INFO L225 Difference]: With dead ends: 58699 [2019-12-18 13:54:00,869 INFO L226 Difference]: Without dead ends: 46349 [2019-12-18 13:54:00,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:54:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46349 states. [2019-12-18 13:54:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46349 to 26304. [2019-12-18 13:54:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26304 states. [2019-12-18 13:54:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26304 states to 26304 states and 78473 transitions. [2019-12-18 13:54:01,400 INFO L78 Accepts]: Start accepts. Automaton has 26304 states and 78473 transitions. Word has length 66 [2019-12-18 13:54:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:01,400 INFO L462 AbstractCegarLoop]: Abstraction has 26304 states and 78473 transitions. [2019-12-18 13:54:01,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:54:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26304 states and 78473 transitions. [2019-12-18 13:54:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:54:01,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:01,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:01,429 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1355417911, now seen corresponding path program 4 times [2019-12-18 13:54:01,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:01,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691326481] [2019-12-18 13:54:01,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:01,632 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 13:54:01,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691326481] [2019-12-18 13:54:01,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:01,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:54:01,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918365927] [2019-12-18 13:54:01,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:54:01,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:54:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:54:01,634 INFO L87 Difference]: Start difference. First operand 26304 states and 78473 transitions. Second operand 12 states. [2019-12-18 13:54:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:05,377 INFO L93 Difference]: Finished difference Result 53722 states and 158664 transitions. [2019-12-18 13:54:05,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:54:05,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 13:54:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:05,453 INFO L225 Difference]: With dead ends: 53722 [2019-12-18 13:54:05,453 INFO L226 Difference]: Without dead ends: 53554 [2019-12-18 13:54:05,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 13:54:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53554 states. [2019-12-18 13:54:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53554 to 29687. [2019-12-18 13:54:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29687 states. [2019-12-18 13:54:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29687 states to 29687 states and 88546 transitions. [2019-12-18 13:54:06,097 INFO L78 Accepts]: Start accepts. Automaton has 29687 states and 88546 transitions. Word has length 66 [2019-12-18 13:54:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:06,097 INFO L462 AbstractCegarLoop]: Abstraction has 29687 states and 88546 transitions. [2019-12-18 13:54:06,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:54:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 29687 states and 88546 transitions. [2019-12-18 13:54:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:54:06,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:06,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:06,129 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:06,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash 729883655, now seen corresponding path program 5 times [2019-12-18 13:54:06,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:06,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970312707] [2019-12-18 13:54:06,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:06,188 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 13:54:06,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970312707] [2019-12-18 13:54:06,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:06,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:06,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223456562] [2019-12-18 13:54:06,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:06,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:06,190 INFO L87 Difference]: Start difference. First operand 29687 states and 88546 transitions. Second operand 3 states. [2019-12-18 13:54:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:06,345 INFO L93 Difference]: Finished difference Result 29687 states and 88545 transitions. [2019-12-18 13:54:06,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:06,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:54:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:06,414 INFO L225 Difference]: With dead ends: 29687 [2019-12-18 13:54:06,414 INFO L226 Difference]: Without dead ends: 29687 [2019-12-18 13:54:06,415 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 13:54:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29687 states. [2019-12-18 13:54:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29687 to 24903. [2019-12-18 13:54:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24903 states. [2019-12-18 13:54:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24903 states to 24903 states and 75221 transitions. [2019-12-18 13:54:07,161 INFO L78 Accepts]: Start accepts. Automaton has 24903 states and 75221 transitions. Word has length 66 [2019-12-18 13:54:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:07,162 INFO L462 AbstractCegarLoop]: Abstraction has 24903 states and 75221 transitions. [2019-12-18 13:54:07,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 24903 states and 75221 transitions. [2019-12-18 13:54:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:54:07,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:07,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:07,204 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-18 13:54:07,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:07,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535616544] [2019-12-18 13:54:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:07,708 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 13:54:07,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535616544] [2019-12-18 13:54:07,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:07,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:54:07,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802822111] [2019-12-18 13:54:07,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:54:07,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:54:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:54:07,710 INFO L87 Difference]: Start difference. First operand 24903 states and 75221 transitions. Second operand 16 states. [2019-12-18 13:54:09,288 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-18 13:54:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:10,467 INFO L93 Difference]: Finished difference Result 31275 states and 92958 transitions. [2019-12-18 13:54:10,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 13:54:10,468 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:54:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:10,511 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 13:54:10,511 INFO L226 Difference]: Without dead ends: 30816 [2019-12-18 13:54:10,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 13:54:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30816 states. [2019-12-18 13:54:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30816 to 24649. [2019-12-18 13:54:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24649 states. [2019-12-18 13:54:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24649 states to 24649 states and 74573 transitions. [2019-12-18 13:54:10,915 INFO L78 Accepts]: Start accepts. Automaton has 24649 states and 74573 transitions. Word has length 67 [2019-12-18 13:54:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:10,915 INFO L462 AbstractCegarLoop]: Abstraction has 24649 states and 74573 transitions. [2019-12-18 13:54:10,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:54:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24649 states and 74573 transitions. [2019-12-18 13:54:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:54:10,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:10,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:10,942 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:10,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-18 13:54:10,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:10,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852778242] [2019-12-18 13:54:10,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:54:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:54:11,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:54:11,054 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:54:11,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26|)) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1391~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1391~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26|) |v_ULTIMATE.start_main_~#t1391~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1391~0.base_26|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_19|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_12|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1391~0.base=|v_ULTIMATE.start_main_~#t1391~0.base_26|, ULTIMATE.start_main_~#t1391~0.offset=|v_ULTIMATE.start_main_~#t1391~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, ULTIMATE.start_main_~#t1392~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1392~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1393~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1391~0.base, ULTIMATE.start_main_~#t1391~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:54:11,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1392~0.base_9| 4) |v_#length_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t1392~0.base_9| 0)) (= |v_ULTIMATE.start_main_~#t1392~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9|) |v_ULTIMATE.start_main_~#t1392~0.offset_8| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1392~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1392~0.offset] because there is no mapped edge [2019-12-18 13:54:11,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| 1) (= 1 ~z$w_buff0~0_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.base_In-2105613132| P0Thread1of1ForFork0_~arg.base_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2105613132| P0Thread1of1ForFork0_~arg.offset_Out-2105613132) (= ~z$w_buff1_used~0_Out-2105613132 ~z$w_buff0_used~0_In-2105613132) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132) (= ~z$w_buff0~0_In-2105613132 ~z$w_buff1~0_Out-2105613132) (= ~z$w_buff0_used~0_Out-2105613132 1) (= 0 (mod ~z$w_buff1_used~0_Out-2105613132 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105613132, ~z$w_buff0~0=~z$w_buff0~0_In-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2105613132, ~z$w_buff0~0=~z$w_buff0~0_Out-2105613132, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|, ~z$w_buff1~0=~z$w_buff1~0_Out-2105613132, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2105613132} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:54:11,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1393~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11|) |v_ULTIMATE.start_main_~#t1393~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1393~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1393~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1393~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1393~0.base] because there is no mapped edge [2019-12-18 13:54:11,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| |P1Thread1of1ForFork1_#t~ite10_Out-1406132799|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1406132799 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1406132799 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z~0_In-1406132799)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z$w_buff1~0_In-1406132799) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1406132799|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1406132799|, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 13:54:11,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In293090503 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In293090503 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| ~z$w_buff0_used~0_In293090503) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out293090503|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:54:11,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1588037877 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1588037877 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1588037877 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1588037877 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|)) (and (= ~z$w_buff1_used~0_In-1588037877 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1588037877|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:54:11,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-681108308 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-681108308 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-681108308| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-681108308 |P1Thread1of1ForFork1_#t~ite13_Out-681108308|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-681108308|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 13:54:11,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In91546019 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| ~z$w_buff1~0_In91546019)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In91546019 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In91546019 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In91546019 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In91546019 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out91546019| ~z$w_buff1~0_In91546019) .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out91546019|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:54:11,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1980040914 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| ~z$w_buff0_used~0_In-1980040914) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1980040914 256)))) (or (= (mod ~z$w_buff0_used~0_In-1980040914 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1980040914 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In-1980040914 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|) (= ~z$w_buff0_used~0_In-1980040914 |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1980040914|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 13:54:11,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-122877400 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-122877400 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-122877400 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-122877400 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-122877400 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-122877400|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:54:11,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:54:11,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In117522236 256) 0))) (or (and (= ~z$w_buff1_used~0_In117522236 |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In117522236| |P2Thread1of1ForFork2_#t~ite29_Out117522236|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In117522236 256)))) (or (and (= (mod ~z$w_buff1_used~0_In117522236 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In117522236 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In117522236 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| ~z$w_buff1_used~0_In117522236)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In117522236|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out117522236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out117522236|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:54:11,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:54:11,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:54:11,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In937064602 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In937064602 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In937064602 |P0Thread1of1ForFork0_#t~ite5_Out937064602|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out937064602|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out937064602|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:54:11,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1467113873 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1467113873 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1467113873 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1467113873 256)))) (or (and (= ~z$w_buff1_used~0_In1467113873 |P0Thread1of1ForFork0_#t~ite6_Out1467113873|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1467113873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1467113873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:54:11,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-576776579 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-576776579 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-576776579)) (and (= ~z$r_buff0_thd1~0_In-576776579 ~z$r_buff0_thd1~0_Out-576776579) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-576776579} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-576776579|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-576776579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:54:11,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-57959045 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-57959045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-57959045 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-57959045 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| ~z$r_buff1_thd1~0_In-57959045) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-57959045|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:54:11,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:54:11,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1037791142 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1037791142 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| |P2Thread1of1ForFork2_#t~ite39_Out1037791142|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z$w_buff1~0_In1037791142) (not .cse0) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z~0_In1037791142) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1037791142|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1037791142|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 13:54:11,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1273260924 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1273260924 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1273260924 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1273260924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 13:54:11,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1353967229 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1353967229 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1353967229 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1353967229 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1353967229| ~z$w_buff1_used~0_In-1353967229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1353967229|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1353967229|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 13:54:11,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-24423748 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-24423748 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| ~z$r_buff0_thd3~0_In-24423748)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-24423748|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 13:54:11,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1108939919 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1108939919 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1108939919 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1108939919 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1108939919| 0)) (and (= ~z$r_buff1_thd3~0_In-1108939919 |P2Thread1of1ForFork2_#t~ite43_Out-1108939919|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1108939919|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 13:54:11,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:54:11,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:54:11,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| |ULTIMATE.start_main_#t~ite48_Out1708150275|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1708150275 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1708150275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z$w_buff1~0_In1708150275) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z~0_In1708150275) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ~z~0=~z~0_In1708150275} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1708150275|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1708150275|, ~z~0=~z~0_In1708150275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:54:11,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-819050452 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-819050452 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-819050452| ~z$w_buff0_used~0_In-819050452) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-819050452| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-819050452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:54:11,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-494240283 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-494240283 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-494240283 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-494240283 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-494240283|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-494240283 |ULTIMATE.start_main_#t~ite50_Out-494240283|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-494240283|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:54:11,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1723803847 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1723803847 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| ~z$r_buff0_thd0~0_In-1723803847)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1723803847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:54:11,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1867815364 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1867815364 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1867815364 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1867815364 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1867815364 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1867815364|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:54:11,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:54:11,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:54:11 BasicIcfg [2019-12-18 13:54:11,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:54:11,186 INFO L168 Benchmark]: Toolchain (without parser) took 107990.84 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,187 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.10 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.4 MB in the beginning and 154.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,192 INFO L168 Benchmark]: Boogie Preprocessor took 40.06 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,193 INFO L168 Benchmark]: RCFGBuilder took 956.92 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 100.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,193 INFO L168 Benchmark]: TraceAbstraction took 106188.75 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 969.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:11,195 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.10 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.4 MB in the beginning and 154.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.06 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 956.92 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 100.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106188.75 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 969.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7048 SDtfs, 8354 SDslu, 22763 SDs, 0 SdLazy, 15823 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 76 SyntacticMatches, 25 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 326245 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 329613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...