/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:09:53,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:09:53,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:09:53,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:09:53,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:09:53,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:09:53,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:09:53,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:09:53,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:09:53,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:09:53,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:09:53,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:09:53,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:09:53,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:09:53,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:09:53,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:09:53,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:09:53,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:09:53,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:09:53,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:09:53,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:09:53,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:09:53,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:09:53,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:09:53,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:09:53,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:09:53,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:09:53,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:09:53,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:09:53,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:09:53,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:09:53,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:09:53,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:09:53,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:09:53,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:09:53,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:09:53,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:09:53,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:09:53,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:09:53,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:09:53,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:09:53,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:09:53,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:09:53,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:09:53,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:09:53,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:09:53,959 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:09:53,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:09:53,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:09:53,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:09:53,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:09:53,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:09:53,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:09:53,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:09:53,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:09:53,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:09:53,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:09:53,961 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:09:53,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:09:53,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:09:53,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:09:53,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:09:53,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:09:53,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:09:53,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:09:53,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:09:53,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:09:53,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:09:53,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:09:53,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:09:53,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:09:54,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:09:54,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:09:54,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:09:54,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:09:54,283 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:09:54,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-18 17:09:54,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f90ba8cc/f28a28bea7984c1b9d603abf2d532cdb/FLAG06380ced6 [2019-12-18 17:09:54,936 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:09:54,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-18 17:09:54,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f90ba8cc/f28a28bea7984c1b9d603abf2d532cdb/FLAG06380ced6 [2019-12-18 17:09:55,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f90ba8cc/f28a28bea7984c1b9d603abf2d532cdb [2019-12-18 17:09:55,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:09:55,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:09:55,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:09:55,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:09:55,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:09:55,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55, skipping insertion in model container [2019-12-18 17:09:55,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:09:55,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:09:55,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:09:55,732 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:09:55,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:09:55,898 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:09:55,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55 WrapperNode [2019-12-18 17:09:55,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:09:55,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:09:55,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:09:55,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:09:55,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:09:55,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:09:55,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:09:55,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:09:55,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:55,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:56,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:56,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (1/1) ... [2019-12-18 17:09:56,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:09:56,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:09:56,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:09:56,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:09:56,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (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 17:09:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:09:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:09:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:09:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:09:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:09:56,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:09:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:09:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:09:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:09:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:09:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:09:56,088 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 17:09:56,775 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:09:56,776 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:09:56,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:09:56 BoogieIcfgContainer [2019-12-18 17:09:56,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:09:56,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:09:56,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:09:56,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:09:56,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:09:55" (1/3) ... [2019-12-18 17:09:56,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bbbc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:09:56, skipping insertion in model container [2019-12-18 17:09:56,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:09:55" (2/3) ... [2019-12-18 17:09:56,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bbbc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:09:56, skipping insertion in model container [2019-12-18 17:09:56,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:09:56" (3/3) ... [2019-12-18 17:09:56,792 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-18 17:09:56,804 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:09:56,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:09:56,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:09:56,821 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:09:56,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,922 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:09:56,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:09:56,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:09:56,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:09:56,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:09:56,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:09:56,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:09:56,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:09:56,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:09:56,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:09:56,997 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-18 17:09:56,999 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 17:09:57,074 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 17:09:57,075 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:09:57,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:09:57,108 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 17:09:57,149 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 17:09:57,150 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:09:57,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:09:57,176 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 17:09:57,177 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:10:02,674 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 17:10:02,799 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:10:02,817 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-18 17:10:02,817 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-18 17:10:02,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-18 17:10:03,241 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 17:10:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 17:10:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:10:03,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:03,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:10:03,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-18 17:10:03,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:03,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491716516] [2019-12-18 17:10:03,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:03,522 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 17:10:03,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491716516] [2019-12-18 17:10:03,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:03,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:10:03,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102848639] [2019-12-18 17:10:03,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:03,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:03,559 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 17:10:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:03,872 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-18 17:10:03,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:03,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:10:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:03,962 INFO L225 Difference]: With dead ends: 8472 [2019-12-18 17:10:03,962 INFO L226 Difference]: Without dead ends: 7980 [2019-12-18 17:10:03,964 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 17:10:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-18 17:10:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-18 17:10:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-18 17:10:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-18 17:10:04,448 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-18 17:10:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:04,448 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-18 17:10:04,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-18 17:10:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:10:04,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:04,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:04,452 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-18 17:10:04,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:04,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006842547] [2019-12-18 17:10:04,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:04,499 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 17:10:04,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006842547] [2019-12-18 17:10:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389400007] [2019-12-18 17:10:04,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:04,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:04,503 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-18 17:10:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:04,531 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-18 17:10:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:04,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:10:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:04,540 INFO L225 Difference]: With dead ends: 1284 [2019-12-18 17:10:04,540 INFO L226 Difference]: Without dead ends: 1284 [2019-12-18 17:10:04,542 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 17:10:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-18 17:10:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-18 17:10:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-18 17:10:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-18 17:10:04,578 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-18 17:10:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:04,578 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-18 17:10:04,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-18 17:10:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:04,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:04,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:04,582 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-18 17:10:04,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:04,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337265974] [2019-12-18 17:10:04,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:04,688 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 17:10:04,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337265974] [2019-12-18 17:10:04,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:04,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:04,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408794304] [2019-12-18 17:10:04,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:04,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:04,691 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-18 17:10:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:04,756 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-18 17:10:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:04,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 17:10:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:04,768 INFO L225 Difference]: With dead ends: 1993 [2019-12-18 17:10:04,768 INFO L226 Difference]: Without dead ends: 1993 [2019-12-18 17:10:04,769 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 17:10:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-18 17:10:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-18 17:10:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-18 17:10:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-18 17:10:04,815 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-18 17:10:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:04,816 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-18 17:10:04,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-18 17:10:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:04,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:04,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:04,817 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-18 17:10:04,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:04,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797381620] [2019-12-18 17:10:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:04,895 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 17:10:04,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797381620] [2019-12-18 17:10:04,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:04,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:04,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807396176] [2019-12-18 17:10:04,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:04,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:04,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:04,900 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-18 17:10:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:05,089 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-18 17:10:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:10:05,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:10:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:05,099 INFO L225 Difference]: With dead ends: 1803 [2019-12-18 17:10:05,101 INFO L226 Difference]: Without dead ends: 1803 [2019-12-18 17:10:05,102 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 17:10:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-18 17:10:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-18 17:10:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-18 17:10:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-18 17:10:05,150 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-18 17:10:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:05,151 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-18 17:10:05,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-18 17:10:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:05,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:05,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:05,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:05,153 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-18 17:10:05,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:05,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134399129] [2019-12-18 17:10:05,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:05,242 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 17:10:05,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134399129] [2019-12-18 17:10:05,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:05,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:05,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507699846] [2019-12-18 17:10:05,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:05,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:05,245 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-18 17:10:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:05,486 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-18 17:10:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:10:05,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:10:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:05,500 INFO L225 Difference]: With dead ends: 2116 [2019-12-18 17:10:05,500 INFO L226 Difference]: Without dead ends: 2116 [2019-12-18 17:10:05,501 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 17:10:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-18 17:10:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-18 17:10:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-18 17:10:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-18 17:10:05,546 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-18 17:10:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:05,546 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-18 17:10:05,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-18 17:10:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:10:05,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:05,550 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 17:10:05,550 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-18 17:10:05,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:05,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069627257] [2019-12-18 17:10:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:05,615 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 17:10:05,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069627257] [2019-12-18 17:10:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40017904] [2019-12-18 17:10:05,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:10:05,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:10:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:10:05,617 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-18 17:10:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:05,906 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-18 17:10:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:10:05,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 17:10:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:05,939 INFO L225 Difference]: With dead ends: 2383 [2019-12-18 17:10:05,939 INFO L226 Difference]: Without dead ends: 2383 [2019-12-18 17:10:05,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 17:10:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-18 17:10:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-18 17:10:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 17:10:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-18 17:10:06,002 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-18 17:10:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:06,004 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-18 17:10:06,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:10:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-18 17:10:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:10:06,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:06,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:06,007 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-18 17:10:06,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:06,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851286145] [2019-12-18 17:10:06,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:06,095 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 17:10:06,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851286145] [2019-12-18 17:10:06,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:06,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:10:06,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372968513] [2019-12-18 17:10:06,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:06,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:06,097 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-18 17:10:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:06,111 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-18 17:10:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:06,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 17:10:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:06,124 INFO L225 Difference]: With dead ends: 2126 [2019-12-18 17:10:06,124 INFO L226 Difference]: Without dead ends: 2126 [2019-12-18 17:10:06,125 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 17:10:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-18 17:10:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-18 17:10:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-18 17:10:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-18 17:10:06,174 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-18 17:10:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:06,175 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-18 17:10:06,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-18 17:10:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:10:06,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:06,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:06,178 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-18 17:10:06,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:06,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935784845] [2019-12-18 17:10:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:06,285 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 17:10:06,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935784845] [2019-12-18 17:10:06,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:06,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:06,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540441685] [2019-12-18 17:10:06,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:10:06,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:10:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:10:06,287 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-18 17:10:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:06,535 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-18 17:10:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:10:06,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:10:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:06,543 INFO L225 Difference]: With dead ends: 2503 [2019-12-18 17:10:06,543 INFO L226 Difference]: Without dead ends: 2503 [2019-12-18 17:10:06,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 17:10:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-18 17:10:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-18 17:10:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-18 17:10:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-18 17:10:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-18 17:10:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:06,592 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-18 17:10:06,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:10:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-18 17:10:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:10:06,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:06,596 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 17:10:06,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-18 17:10:06,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:06,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102580041] [2019-12-18 17:10:06,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:06,647 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 17:10:06,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102580041] [2019-12-18 17:10:06,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:06,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:06,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761115399] [2019-12-18 17:10:06,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:06,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:06,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:06,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:06,650 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 4 states. [2019-12-18 17:10:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:06,678 INFO L93 Difference]: Finished difference Result 3149 states and 7351 transitions. [2019-12-18 17:10:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:10:06,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 17:10:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:06,683 INFO L225 Difference]: With dead ends: 3149 [2019-12-18 17:10:06,683 INFO L226 Difference]: Without dead ends: 1449 [2019-12-18 17:10:06,684 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 17:10:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-18 17:10:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1433. [2019-12-18 17:10:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-18 17:10:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-18 17:10:06,716 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-18 17:10:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:06,716 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-18 17:10:06,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-18 17:10:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:10:06,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:06,719 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 17:10:06,719 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-18 17:10:06,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:06,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617456671] [2019-12-18 17:10:06,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:06,795 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 17:10:06,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617456671] [2019-12-18 17:10:06,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:06,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:10:06,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771690685] [2019-12-18 17:10:06,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:10:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:10:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:10:06,798 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 5 states. [2019-12-18 17:10:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:07,352 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-18 17:10:07,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:10:07,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 17:10:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:07,359 INFO L225 Difference]: With dead ends: 2262 [2019-12-18 17:10:07,359 INFO L226 Difference]: Without dead ends: 2262 [2019-12-18 17:10:07,359 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 17:10:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-18 17:10:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-18 17:10:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-18 17:10:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-18 17:10:07,404 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-18 17:10:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:07,405 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-18 17:10:07,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:10:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-18 17:10:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:10:07,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:07,409 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] [2019-12-18 17:10:07,409 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-18 17:10:07,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:07,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666934769] [2019-12-18 17:10:07,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:07,452 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 17:10:07,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666934769] [2019-12-18 17:10:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:07,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:07,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095754388] [2019-12-18 17:10:07,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:07,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:07,454 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-18 17:10:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:07,473 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-18 17:10:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:10:07,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 17:10:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:07,476 INFO L225 Difference]: With dead ends: 1113 [2019-12-18 17:10:07,477 INFO L226 Difference]: Without dead ends: 1002 [2019-12-18 17:10:07,477 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 17:10:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-18 17:10:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-18 17:10:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-18 17:10:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-18 17:10:07,497 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-18 17:10:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:07,497 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-18 17:10:07,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-18 17:10:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:10:07,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:07,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:07,500 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-18 17:10:07,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:07,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983886319] [2019-12-18 17:10:07,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:07,614 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 17:10:07,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983886319] [2019-12-18 17:10:07,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:07,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:10:07,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107606024] [2019-12-18 17:10:07,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:10:07,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:10:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:10:07,616 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-18 17:10:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:07,928 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-18 17:10:07,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:10:07,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 17:10:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:07,934 INFO L225 Difference]: With dead ends: 2777 [2019-12-18 17:10:07,934 INFO L226 Difference]: Without dead ends: 1853 [2019-12-18 17:10:07,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:10:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-18 17:10:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-18 17:10:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-18 17:10:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-18 17:10:07,960 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-18 17:10:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:07,961 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-18 17:10:07,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:10:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-18 17:10:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:10:07,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:07,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:07,964 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-18 17:10:07,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:07,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737830901] [2019-12-18 17:10:07,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:08,045 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 17:10:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737830901] [2019-12-18 17:10:08,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:08,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:08,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76130923] [2019-12-18 17:10:08,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:08,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:08,047 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 3 states. [2019-12-18 17:10:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:08,102 INFO L93 Difference]: Finished difference Result 1234 states and 2682 transitions. [2019-12-18 17:10:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:08,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 17:10:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:08,106 INFO L225 Difference]: With dead ends: 1234 [2019-12-18 17:10:08,106 INFO L226 Difference]: Without dead ends: 1234 [2019-12-18 17:10:08,107 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 17:10:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-18 17:10:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1032. [2019-12-18 17:10:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-12-18 17:10:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 2281 transitions. [2019-12-18 17:10:08,129 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 2281 transitions. Word has length 51 [2019-12-18 17:10:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:08,129 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 2281 transitions. [2019-12-18 17:10:08,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 2281 transitions. [2019-12-18 17:10:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:10:08,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:08,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:08,133 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash -232907078, now seen corresponding path program 1 times [2019-12-18 17:10:08,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:08,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654338155] [2019-12-18 17:10:08,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:08,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 17:10:08,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654338155] [2019-12-18 17:10:08,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:08,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:10:08,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590138627] [2019-12-18 17:10:08,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:08,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:08,187 INFO L87 Difference]: Start difference. First operand 1032 states and 2281 transitions. Second operand 4 states. [2019-12-18 17:10:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:08,448 INFO L93 Difference]: Finished difference Result 1622 states and 3562 transitions. [2019-12-18 17:10:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:10:08,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 17:10:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:08,454 INFO L225 Difference]: With dead ends: 1622 [2019-12-18 17:10:08,455 INFO L226 Difference]: Without dead ends: 1622 [2019-12-18 17:10:08,457 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 17:10:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-18 17:10:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1091. [2019-12-18 17:10:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-12-18 17:10:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2427 transitions. [2019-12-18 17:10:08,501 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2427 transitions. Word has length 52 [2019-12-18 17:10:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:08,501 INFO L462 AbstractCegarLoop]: Abstraction has 1091 states and 2427 transitions. [2019-12-18 17:10:08,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2427 transitions. [2019-12-18 17:10:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:10:08,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:08,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:08,505 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1437488850, now seen corresponding path program 1 times [2019-12-18 17:10:08,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:08,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398113570] [2019-12-18 17:10:08,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:08,610 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 17:10:08,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398113570] [2019-12-18 17:10:08,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:08,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:10:08,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078016901] [2019-12-18 17:10:08,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:10:08,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:10:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:10:08,613 INFO L87 Difference]: Start difference. First operand 1091 states and 2427 transitions. Second operand 5 states. [2019-12-18 17:10:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:08,913 INFO L93 Difference]: Finished difference Result 1436 states and 3139 transitions. [2019-12-18 17:10:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:10:08,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 17:10:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:08,918 INFO L225 Difference]: With dead ends: 1436 [2019-12-18 17:10:08,918 INFO L226 Difference]: Without dead ends: 1436 [2019-12-18 17:10:08,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:10:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-12-18 17:10:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1284. [2019-12-18 17:10:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-18 17:10:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2836 transitions. [2019-12-18 17:10:08,943 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2836 transitions. Word has length 52 [2019-12-18 17:10:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:08,943 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2836 transitions. [2019-12-18 17:10:08,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:10:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2836 transitions. [2019-12-18 17:10:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:10:08,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:08,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:08,947 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 905926424, now seen corresponding path program 1 times [2019-12-18 17:10:08,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:08,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615290311] [2019-12-18 17:10:08,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:09,030 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 17:10:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615290311] [2019-12-18 17:10:09,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:09,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:10:09,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160317550] [2019-12-18 17:10:09,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:10:09,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:10:09,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:10:09,037 INFO L87 Difference]: Start difference. First operand 1284 states and 2836 transitions. Second operand 7 states. [2019-12-18 17:10:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:09,290 INFO L93 Difference]: Finished difference Result 2874 states and 6031 transitions. [2019-12-18 17:10:09,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:10:09,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 17:10:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:09,296 INFO L225 Difference]: With dead ends: 2874 [2019-12-18 17:10:09,297 INFO L226 Difference]: Without dead ends: 2405 [2019-12-18 17:10:09,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:10:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-12-18 17:10:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1279. [2019-12-18 17:10:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-12-18 17:10:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2821 transitions. [2019-12-18 17:10:09,327 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2821 transitions. Word has length 52 [2019-12-18 17:10:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:09,329 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 2821 transitions. [2019-12-18 17:10:09,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:10:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2821 transitions. [2019-12-18 17:10:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:10:09,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:09,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:09,333 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1875488952, now seen corresponding path program 2 times [2019-12-18 17:10:09,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:09,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866301699] [2019-12-18 17:10:09,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:09,463 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 17:10:09,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866301699] [2019-12-18 17:10:09,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:09,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:09,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808465579] [2019-12-18 17:10:09,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:09,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:09,467 INFO L87 Difference]: Start difference. First operand 1279 states and 2821 transitions. Second operand 4 states. [2019-12-18 17:10:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:09,545 INFO L93 Difference]: Finished difference Result 1279 states and 2807 transitions. [2019-12-18 17:10:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:10:09,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 17:10:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:09,549 INFO L225 Difference]: With dead ends: 1279 [2019-12-18 17:10:09,549 INFO L226 Difference]: Without dead ends: 1279 [2019-12-18 17:10:09,550 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 17:10:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-18 17:10:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1161. [2019-12-18 17:10:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-18 17:10:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2543 transitions. [2019-12-18 17:10:09,569 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2543 transitions. Word has length 52 [2019-12-18 17:10:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:09,570 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2543 transitions. [2019-12-18 17:10:09,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2543 transitions. [2019-12-18 17:10:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:10:09,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:09,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:09,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:09,574 INFO L82 PathProgramCache]: Analyzing trace with hash -976265928, now seen corresponding path program 1 times [2019-12-18 17:10:09,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:09,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346520456] [2019-12-18 17:10:09,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:09,691 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 17:10:09,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346520456] [2019-12-18 17:10:09,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:09,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:09,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229489640] [2019-12-18 17:10:09,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:09,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:09,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:09,698 INFO L87 Difference]: Start difference. First operand 1161 states and 2543 transitions. Second operand 3 states. [2019-12-18 17:10:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:09,713 INFO L93 Difference]: Finished difference Result 1160 states and 2541 transitions. [2019-12-18 17:10:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:09,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 17:10:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:09,716 INFO L225 Difference]: With dead ends: 1160 [2019-12-18 17:10:09,716 INFO L226 Difference]: Without dead ends: 1160 [2019-12-18 17:10:09,717 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 17:10:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-12-18 17:10:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1053. [2019-12-18 17:10:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-12-18 17:10:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 2347 transitions. [2019-12-18 17:10:09,741 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 2347 transitions. Word has length 52 [2019-12-18 17:10:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:09,742 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 2347 transitions. [2019-12-18 17:10:09,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2347 transitions. [2019-12-18 17:10:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 17:10:09,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:09,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:09,746 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-18 17:10:09,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:09,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225852904] [2019-12-18 17:10:09,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:10:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:10:09,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:10:09,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:10:09,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35|)) (= 0 v_~a$w_buff1~0_316) (= (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t833~0.offset_23| 0) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t833~0.base_35| 4)) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35|) |v_ULTIMATE.start_main_~#t833~0.offset_23| 0)) |v_#memory_int_13|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t833~0.base_35|) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_27|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_23|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_35|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-18 17:10:09,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= (mod ~a$w_buff1_used~0_Out-282435237 256) 0) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-282435237| 1) (= 1 ~a$w_buff0_used~0_Out-282435237) (= ~a$w_buff1~0_Out-282435237 ~a$w_buff0~0_In-282435237) (= ~a$w_buff0~0_Out-282435237 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In-282435237| P0Thread1of1ForFork0_~arg.offset_Out-282435237) (= P0Thread1of1ForFork0_~arg.base_Out-282435237 |P0Thread1of1ForFork0_#in~arg.base_In-282435237|) (= ~a$w_buff1_used~0_Out-282435237 ~a$w_buff0_used~0_In-282435237) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-282435237| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-282435237)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-282435237|, ~a$w_buff0~0=~a$w_buff0~0_In-282435237, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-282435237|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-282435237} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-282435237|, ~a$w_buff1~0=~a$w_buff1~0_Out-282435237, ~a$w_buff0~0=~a$w_buff0~0_Out-282435237, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-282435237, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-282435237|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-282435237, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-282435237, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-282435237, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-282435237|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-282435237} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:10:09,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:10:09,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In476355163 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In476355163 256) 0))) (or (= (mod ~a$w_buff0_used~0_In476355163 256) 0) (and .cse0 (= (mod ~a$r_buff1_thd2~0_In476355163 256) 0)) (and .cse0 (= (mod ~a$w_buff1_used~0_In476355163 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite24_Out476355163| |P1Thread1of1ForFork1_#t~ite23_Out476355163|) (= |P1Thread1of1ForFork1_#t~ite23_Out476355163| ~a$w_buff1_used~0_In476355163) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In476355163| |P1Thread1of1ForFork1_#t~ite23_Out476355163|) (= |P1Thread1of1ForFork1_#t~ite24_Out476355163| ~a$w_buff1_used~0_In476355163)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In476355163, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In476355163, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In476355163|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In476355163, ~a$w_buff1_used~0=~a$w_buff1_used~0_In476355163, ~weak$$choice2~0=~weak$$choice2~0_In476355163} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In476355163, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out476355163|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In476355163, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out476355163|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In476355163, ~a$w_buff1_used~0=~a$w_buff1_used~0_In476355163, ~weak$$choice2~0=~weak$$choice2~0_In476355163} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 17:10:09,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 17:10:09,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-381306704 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-381306704 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-381306704|) (not .cse1)) (and (= ~a$w_buff0_used~0_In-381306704 |P0Thread1of1ForFork0_#t~ite5_Out-381306704|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-381306704, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-381306704} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-381306704|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-381306704, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-381306704} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:10:09,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1754277617 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1754277617 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1754277617 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1754277617 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1754277617 |P0Thread1of1ForFork0_#t~ite6_Out1754277617|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1754277617|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1754277617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1754277617, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1754277617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1754277617} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1754277617|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1754277617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1754277617, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1754277617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1754277617} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:10:09,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1210511782 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1210511782 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out1210511782 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out1210511782 ~a$r_buff0_thd1~0_In1210511782)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1210511782, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1210511782} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1210511782|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1210511782, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1210511782} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:10:09,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In872490169 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In872490169 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In872490169 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In872490169 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out872490169| ~a$r_buff1_thd1~0_In872490169) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out872490169| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In872490169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In872490169, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In872490169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872490169} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In872490169, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out872490169|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In872490169, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In872490169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872490169} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:10:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:10:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:10:09,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1461018663 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1461018663 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1461018663| |P1Thread1of1ForFork1_#t~ite32_Out1461018663|))) (or (and (= ~a~0_In1461018663 |P1Thread1of1ForFork1_#t~ite32_Out1461018663|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= ~a$w_buff1~0_In1461018663 |P1Thread1of1ForFork1_#t~ite32_Out1461018663|) .cse0))) InVars {~a~0=~a~0_In1461018663, ~a$w_buff1~0=~a$w_buff1~0_In1461018663, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1461018663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1461018663} OutVars{~a~0=~a~0_In1461018663, ~a$w_buff1~0=~a$w_buff1~0_In1461018663, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1461018663, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1461018663|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1461018663|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1461018663} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 17:10:09,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In473548496 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In473548496 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out473548496|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In473548496 |P1Thread1of1ForFork1_#t~ite34_Out473548496|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In473548496, ~a$w_buff0_used~0=~a$w_buff0_used~0_In473548496} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out473548496|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In473548496, ~a$w_buff0_used~0=~a$w_buff0_used~0_In473548496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 17:10:09,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1883850176 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1883850176 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1883850176 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1883850176 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1883850176| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1883850176 |P1Thread1of1ForFork1_#t~ite35_Out1883850176|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1883850176, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1883850176, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1883850176, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1883850176} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1883850176, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1883850176, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1883850176, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1883850176|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1883850176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 17:10:09,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-365068583 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-365068583 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-365068583|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In-365068583 |P1Thread1of1ForFork1_#t~ite36_Out-365068583|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-365068583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-365068583} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-365068583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-365068583, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-365068583|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 17:10:09,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd2~0_In-1431556369 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1431556369 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1431556369 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1431556369 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-1431556369 |P1Thread1of1ForFork1_#t~ite37_Out-1431556369|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1431556369|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1431556369, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1431556369, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1431556369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1431556369} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1431556369, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1431556369, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1431556369, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1431556369, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1431556369|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:10:09,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:10:09,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:10:09,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In936200758 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In936200758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out936200758| ~a~0_In936200758) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out936200758| ~a$w_buff1~0_In936200758) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In936200758, ~a$w_buff1~0=~a$w_buff1~0_In936200758, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In936200758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In936200758} OutVars{~a~0=~a~0_In936200758, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out936200758|, ~a$w_buff1~0=~a$w_buff1~0_In936200758, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In936200758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In936200758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:10:09,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:10:09,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In2052328930 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2052328930 256)))) (or (and (= ~a$w_buff0_used~0_In2052328930 |ULTIMATE.start_main_#t~ite42_Out2052328930|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2052328930| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2052328930, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2052328930} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2052328930, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2052328930, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2052328930|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:10:09,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-672324025 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-672324025 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-672324025 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-672324025 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-672324025| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-672324025| ~a$w_buff1_used~0_In-672324025) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-672324025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-672324025, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-672324025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-672324025} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-672324025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-672324025, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-672324025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-672324025, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-672324025|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:10:09,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-234895545 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-234895545 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-234895545 |ULTIMATE.start_main_#t~ite44_Out-234895545|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-234895545|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-234895545, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-234895545} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-234895545, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-234895545, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-234895545|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:10:09,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2043033668 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In2043033668 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2043033668 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2043033668 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out2043033668| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out2043033668| ~a$r_buff1_thd0~0_In2043033668)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2043033668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2043033668, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2043033668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2043033668} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2043033668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2043033668, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2043033668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2043033668, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2043033668|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:10:09,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:10:10,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:10:10 BasicIcfg [2019-12-18 17:10:10,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:10:10,090 INFO L168 Benchmark]: Toolchain (without parser) took 14876.46 ms. Allocated memory was 144.2 MB in the beginning and 468.7 MB in the end (delta: 324.5 MB). Free memory was 100.0 MB in the beginning and 180.0 MB in the end (delta: -80.0 MB). Peak memory consumption was 244.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,090 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.92 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.44 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,092 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,093 INFO L168 Benchmark]: RCFGBuilder took 758.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 105.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,093 INFO L168 Benchmark]: TraceAbstraction took 13308.99 ms. Allocated memory was 201.9 MB in the beginning and 468.7 MB in the end (delta: 266.9 MB). Free memory was 105.2 MB in the beginning and 180.0 MB in the end (delta: -74.8 MB). Peak memory consumption was 192.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:10,097 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.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 681.92 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.44 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.13 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 105.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13308.99 ms. Allocated memory was 201.9 MB in the beginning and 468.7 MB in the end (delta: 266.9 MB). Free memory was 105.2 MB in the beginning and 180.0 MB in the end (delta: -74.8 MB). Peak memory consumption was 192.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2181 SDtfs, 2016 SDslu, 3753 SDs, 0 SdLazy, 1820 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 5006 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 79922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...