/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:11:27,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:11:27,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:11:27,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:11:27,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:11:27,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:11:27,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:11:27,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:11:27,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:11:27,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:11:27,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:11:27,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:11:27,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:11:27,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:11:27,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:11:27,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:11:27,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:11:27,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:11:27,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:11:27,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:11:27,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:11:27,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:11:27,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:11:27,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:11:27,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:11:27,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:11:27,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:11:27,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:11:27,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:11:27,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:11:27,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:11:27,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:11:27,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:11:27,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:11:27,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:11:27,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:11:27,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:11:27,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:11:27,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:11:27,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:11:27,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:11:27,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:11:27,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:11:27,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:11:27,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:11:27,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:11:27,888 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:11:27,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:11:27,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:11:27,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:11:27,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:11:27,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:11:27,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:11:27,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:11:27,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:11:27,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:11:27,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:11:27,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:11:27,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:11:27,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:11:27,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:11:27,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:11:27,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:11:27,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:27,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:11:27,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:11:27,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:11:27,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:11:27,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:11:27,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:11:27,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:11:27,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:11:28,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:11:28,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:11:28,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:11:28,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:11:28,195 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:11:28,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-18 21:11:28,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fb2056a/3ffee7e21b104ff5907689fa032580f1/FLAGdd29f4a0a [2019-12-18 21:11:28,816 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:11:28,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-18 21:11:28,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fb2056a/3ffee7e21b104ff5907689fa032580f1/FLAGdd29f4a0a [2019-12-18 21:11:29,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fb2056a/3ffee7e21b104ff5907689fa032580f1 [2019-12-18 21:11:29,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:11:29,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:11:29,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:29,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:11:29,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:11:29,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3265302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29, skipping insertion in model container [2019-12-18 21:11:29,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:11:29,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:11:29,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:29,734 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:11:29,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:29,879 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:11:29,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29 WrapperNode [2019-12-18 21:11:29,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:29,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:29,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:11:29,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:11:29,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:29,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:11:29,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:11:29,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:11:29,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... [2019-12-18 21:11:29,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:11:29,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:11:29,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:11:29,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:11:29,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:11:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:11:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:11:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:11:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:11:30,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:11:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:11:30,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:11:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:11:30,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:11:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:11:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:11:30,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:11:30,068 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:11:30,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:11:30,832 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:11:30,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:30 BoogieIcfgContainer [2019-12-18 21:11:30,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:11:30,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:11:30,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:11:30,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:11:30,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:11:29" (1/3) ... [2019-12-18 21:11:30,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd13331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:30, skipping insertion in model container [2019-12-18 21:11:30,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:29" (2/3) ... [2019-12-18 21:11:30,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd13331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:30, skipping insertion in model container [2019-12-18 21:11:30,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:30" (3/3) ... [2019-12-18 21:11:30,842 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2019-12-18 21:11:30,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:11:30,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:11:30,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:11:30,864 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:11:30,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:30,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:31,028 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:11:31,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:11:31,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:11:31,051 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:11:31,051 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:11:31,051 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:11:31,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:11:31,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:11:31,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:11:31,074 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 21:11:31,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 21:11:31,177 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 21:11:31,178 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:31,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:11:31,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 21:11:31,288 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 21:11:31,288 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:31,300 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:11:31,323 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 21:11:31,324 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:11:34,742 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:11:34,869 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:11:35,009 INFO L206 etLargeBlockEncoding]: Checked pairs total: 71962 [2019-12-18 21:11:35,010 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 21:11:35,013 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 96 transitions [2019-12-18 21:11:49,621 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 101822 states. [2019-12-18 21:11:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 101822 states. [2019-12-18 21:11:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:11:49,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:49,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:11:49,632 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 797474839, now seen corresponding path program 1 times [2019-12-18 21:11:49,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:49,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325990637] [2019-12-18 21:11:49,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:49,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325990637] [2019-12-18 21:11:49,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:49,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:49,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885533661] [2019-12-18 21:11:49,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:49,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:49,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:49,889 INFO L87 Difference]: Start difference. First operand 101822 states. Second operand 3 states. [2019-12-18 21:11:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:51,162 INFO L93 Difference]: Finished difference Result 99897 states and 434561 transitions. [2019-12-18 21:11:51,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:51,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:11:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:54,477 INFO L225 Difference]: With dead ends: 99897 [2019-12-18 21:11:54,481 INFO L226 Difference]: Without dead ends: 94017 [2019-12-18 21:11:54,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94017 states. [2019-12-18 21:12:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94017 to 94017. [2019-12-18 21:12:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94017 states. [2019-12-18 21:12:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94017 states to 94017 states and 408465 transitions. [2019-12-18 21:12:01,010 INFO L78 Accepts]: Start accepts. Automaton has 94017 states and 408465 transitions. Word has length 5 [2019-12-18 21:12:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:01,011 INFO L462 AbstractCegarLoop]: Abstraction has 94017 states and 408465 transitions. [2019-12-18 21:12:01,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94017 states and 408465 transitions. [2019-12-18 21:12:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:12:01,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:01,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:01,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1757025115, now seen corresponding path program 1 times [2019-12-18 21:12:01,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:01,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754508452] [2019-12-18 21:12:01,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:01,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754508452] [2019-12-18 21:12:01,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:01,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:01,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580081552] [2019-12-18 21:12:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:01,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:01,122 INFO L87 Difference]: Start difference. First operand 94017 states and 408465 transitions. Second operand 3 states. [2019-12-18 21:12:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:01,317 INFO L93 Difference]: Finished difference Result 23899 states and 83357 transitions. [2019-12-18 21:12:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:01,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:12:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:01,398 INFO L225 Difference]: With dead ends: 23899 [2019-12-18 21:12:01,398 INFO L226 Difference]: Without dead ends: 23899 [2019-12-18 21:12:01,399 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 21:12:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2019-12-18 21:12:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 23899. [2019-12-18 21:12:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23899 states. [2019-12-18 21:12:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23899 states to 23899 states and 83357 transitions. [2019-12-18 21:12:05,535 INFO L78 Accepts]: Start accepts. Automaton has 23899 states and 83357 transitions. Word has length 13 [2019-12-18 21:12:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:05,536 INFO L462 AbstractCegarLoop]: Abstraction has 23899 states and 83357 transitions. [2019-12-18 21:12:05,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 23899 states and 83357 transitions. [2019-12-18 21:12:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:12:05,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:05,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:05,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1772800501, now seen corresponding path program 1 times [2019-12-18 21:12:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:05,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608813374] [2019-12-18 21:12:05,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:05,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608813374] [2019-12-18 21:12:05,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:05,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:05,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275767851] [2019-12-18 21:12:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:05,678 INFO L87 Difference]: Start difference. First operand 23899 states and 83357 transitions. Second operand 4 states. [2019-12-18 21:12:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:06,128 INFO L93 Difference]: Finished difference Result 35061 states and 117944 transitions. [2019-12-18 21:12:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:06,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:12:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:06,206 INFO L225 Difference]: With dead ends: 35061 [2019-12-18 21:12:06,206 INFO L226 Difference]: Without dead ends: 35047 [2019-12-18 21:12:06,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35047 states. [2019-12-18 21:12:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35047 to 31443. [2019-12-18 21:12:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31443 states. [2019-12-18 21:12:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31443 states to 31443 states and 107008 transitions. [2019-12-18 21:12:07,216 INFO L78 Accepts]: Start accepts. Automaton has 31443 states and 107008 transitions. Word has length 13 [2019-12-18 21:12:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:07,216 INFO L462 AbstractCegarLoop]: Abstraction has 31443 states and 107008 transitions. [2019-12-18 21:12:07,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31443 states and 107008 transitions. [2019-12-18 21:12:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:12:07,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:07,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:07,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1424057850, now seen corresponding path program 1 times [2019-12-18 21:12:07,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:07,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911216803] [2019-12-18 21:12:07,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:07,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911216803] [2019-12-18 21:12:07,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:07,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342357054] [2019-12-18 21:12:07,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:07,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:07,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:07,344 INFO L87 Difference]: Start difference. First operand 31443 states and 107008 transitions. Second operand 5 states. [2019-12-18 21:12:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:08,208 INFO L93 Difference]: Finished difference Result 45557 states and 152262 transitions. [2019-12-18 21:12:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:12:08,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:12:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:08,323 INFO L225 Difference]: With dead ends: 45557 [2019-12-18 21:12:08,324 INFO L226 Difference]: Without dead ends: 45539 [2019-12-18 21:12:08,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45539 states. [2019-12-18 21:12:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45539 to 37201. [2019-12-18 21:12:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37201 states. [2019-12-18 21:12:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37201 states to 37201 states and 125618 transitions. [2019-12-18 21:12:09,337 INFO L78 Accepts]: Start accepts. Automaton has 37201 states and 125618 transitions. Word has length 14 [2019-12-18 21:12:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:09,338 INFO L462 AbstractCegarLoop]: Abstraction has 37201 states and 125618 transitions. [2019-12-18 21:12:09,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 37201 states and 125618 transitions. [2019-12-18 21:12:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:12:09,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:09,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:09,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1169616424, now seen corresponding path program 1 times [2019-12-18 21:12:09,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:09,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216461397] [2019-12-18 21:12:09,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:09,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216461397] [2019-12-18 21:12:09,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:09,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:09,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359065754] [2019-12-18 21:12:09,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:12:09,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:12:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:09,462 INFO L87 Difference]: Start difference. First operand 37201 states and 125618 transitions. Second operand 6 states. [2019-12-18 21:12:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:10,404 INFO L93 Difference]: Finished difference Result 55837 states and 184006 transitions. [2019-12-18 21:12:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:10,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:12:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:10,507 INFO L225 Difference]: With dead ends: 55837 [2019-12-18 21:12:10,507 INFO L226 Difference]: Without dead ends: 55807 [2019-12-18 21:12:10,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:12:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55807 states. [2019-12-18 21:12:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55807 to 37101. [2019-12-18 21:12:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37101 states. [2019-12-18 21:12:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37101 states to 37101 states and 124278 transitions. [2019-12-18 21:12:11,730 INFO L78 Accepts]: Start accepts. Automaton has 37101 states and 124278 transitions. Word has length 22 [2019-12-18 21:12:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:11,730 INFO L462 AbstractCegarLoop]: Abstraction has 37101 states and 124278 transitions. [2019-12-18 21:12:11,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:12:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37101 states and 124278 transitions. [2019-12-18 21:12:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:12:11,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:11,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:11,747 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 189468664, now seen corresponding path program 1 times [2019-12-18 21:12:11,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:11,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281639755] [2019-12-18 21:12:11,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:11,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281639755] [2019-12-18 21:12:11,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:11,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:11,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203083561] [2019-12-18 21:12:11,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:11,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:11,817 INFO L87 Difference]: Start difference. First operand 37101 states and 124278 transitions. Second operand 4 states. [2019-12-18 21:12:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:11,903 INFO L93 Difference]: Finished difference Result 14221 states and 44268 transitions. [2019-12-18 21:12:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:12:11,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:12:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:11,931 INFO L225 Difference]: With dead ends: 14221 [2019-12-18 21:12:11,932 INFO L226 Difference]: Without dead ends: 14221 [2019-12-18 21:12:11,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2019-12-18 21:12:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 14021. [2019-12-18 21:12:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-12-18 21:12:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 43688 transitions. [2019-12-18 21:12:12,161 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 43688 transitions. Word has length 25 [2019-12-18 21:12:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:12,162 INFO L462 AbstractCegarLoop]: Abstraction has 14021 states and 43688 transitions. [2019-12-18 21:12:12,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 43688 transitions. [2019-12-18 21:12:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:12:12,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:12,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:12,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1050743486, now seen corresponding path program 1 times [2019-12-18 21:12:12,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:12,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384672328] [2019-12-18 21:12:12,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:12,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384672328] [2019-12-18 21:12:12,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:12,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:12,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387301416] [2019-12-18 21:12:12,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:12,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:12,299 INFO L87 Difference]: Start difference. First operand 14021 states and 43688 transitions. Second operand 3 states. [2019-12-18 21:12:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:12,363 INFO L93 Difference]: Finished difference Result 13408 states and 41262 transitions. [2019-12-18 21:12:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:12,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:12:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:12,382 INFO L225 Difference]: With dead ends: 13408 [2019-12-18 21:12:12,382 INFO L226 Difference]: Without dead ends: 13408 [2019-12-18 21:12:12,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13408 states. [2019-12-18 21:12:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13408 to 13392. [2019-12-18 21:12:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13392 states. [2019-12-18 21:12:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13392 states to 13392 states and 41222 transitions. [2019-12-18 21:12:12,578 INFO L78 Accepts]: Start accepts. Automaton has 13392 states and 41222 transitions. Word has length 39 [2019-12-18 21:12:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:12,578 INFO L462 AbstractCegarLoop]: Abstraction has 13392 states and 41222 transitions. [2019-12-18 21:12:12,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13392 states and 41222 transitions. [2019-12-18 21:12:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:12:12,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:12,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -801502219, now seen corresponding path program 1 times [2019-12-18 21:12:12,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:12,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122411710] [2019-12-18 21:12:12,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:12,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122411710] [2019-12-18 21:12:12,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:12,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:12,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623994121] [2019-12-18 21:12:12,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:12,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:12,667 INFO L87 Difference]: Start difference. First operand 13392 states and 41222 transitions. Second operand 5 states. [2019-12-18 21:12:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:12,755 INFO L93 Difference]: Finished difference Result 12049 states and 37780 transitions. [2019-12-18 21:12:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:12,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:12:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:12,784 INFO L225 Difference]: With dead ends: 12049 [2019-12-18 21:12:12,784 INFO L226 Difference]: Without dead ends: 12049 [2019-12-18 21:12:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12049 states. [2019-12-18 21:12:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12049 to 11564. [2019-12-18 21:12:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11564 states. [2019-12-18 21:12:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11564 states to 11564 states and 36424 transitions. [2019-12-18 21:12:13,231 INFO L78 Accepts]: Start accepts. Automaton has 11564 states and 36424 transitions. Word has length 40 [2019-12-18 21:12:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:13,231 INFO L462 AbstractCegarLoop]: Abstraction has 11564 states and 36424 transitions. [2019-12-18 21:12:13,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11564 states and 36424 transitions. [2019-12-18 21:12:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:13,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:13,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:13,255 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -68448831, now seen corresponding path program 1 times [2019-12-18 21:12:13,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:13,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293577085] [2019-12-18 21:12:13,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:13,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293577085] [2019-12-18 21:12:13,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:13,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:13,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043035502] [2019-12-18 21:12:13,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:13,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:13,334 INFO L87 Difference]: Start difference. First operand 11564 states and 36424 transitions. Second operand 3 states. [2019-12-18 21:12:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:13,422 INFO L93 Difference]: Finished difference Result 15451 states and 47658 transitions. [2019-12-18 21:12:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:13,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:12:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:13,444 INFO L225 Difference]: With dead ends: 15451 [2019-12-18 21:12:13,444 INFO L226 Difference]: Without dead ends: 15451 [2019-12-18 21:12:13,445 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 21:12:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2019-12-18 21:12:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 12872. [2019-12-18 21:12:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-12-18 21:12:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 40319 transitions. [2019-12-18 21:12:13,653 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 40319 transitions. Word has length 55 [2019-12-18 21:12:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:13,653 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 40319 transitions. [2019-12-18 21:12:13,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 40319 transitions. [2019-12-18 21:12:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:13,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:13,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:13,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1776209793, now seen corresponding path program 1 times [2019-12-18 21:12:13,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:13,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647823359] [2019-12-18 21:12:13,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:13,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647823359] [2019-12-18 21:12:13,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:13,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:13,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787603463] [2019-12-18 21:12:13,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:13,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:13,756 INFO L87 Difference]: Start difference. First operand 12872 states and 40319 transitions. Second operand 4 states. [2019-12-18 21:12:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:13,847 INFO L93 Difference]: Finished difference Result 23217 states and 72635 transitions. [2019-12-18 21:12:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:12:13,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-18 21:12:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:13,863 INFO L225 Difference]: With dead ends: 23217 [2019-12-18 21:12:13,863 INFO L226 Difference]: Without dead ends: 10665 [2019-12-18 21:12:13,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-18 21:12:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 10665. [2019-12-18 21:12:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-18 21:12:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 33189 transitions. [2019-12-18 21:12:14,022 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 33189 transitions. Word has length 55 [2019-12-18 21:12:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:14,022 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 33189 transitions. [2019-12-18 21:12:14,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 33189 transitions. [2019-12-18 21:12:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:14,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:14,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:14,035 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash 673645833, now seen corresponding path program 2 times [2019-12-18 21:12:14,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:14,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781988750] [2019-12-18 21:12:14,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:14,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781988750] [2019-12-18 21:12:14,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:14,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:12:14,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883279293] [2019-12-18 21:12:14,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:12:14,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:12:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:12:14,166 INFO L87 Difference]: Start difference. First operand 10665 states and 33189 transitions. Second operand 9 states. [2019-12-18 21:12:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:15,749 INFO L93 Difference]: Finished difference Result 26582 states and 82491 transitions. [2019-12-18 21:12:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 21:12:15,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 21:12:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:15,778 INFO L225 Difference]: With dead ends: 26582 [2019-12-18 21:12:15,778 INFO L226 Difference]: Without dead ends: 18328 [2019-12-18 21:12:15,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:12:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18328 states. [2019-12-18 21:12:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18328 to 13487. [2019-12-18 21:12:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13487 states. [2019-12-18 21:12:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13487 states to 13487 states and 41624 transitions. [2019-12-18 21:12:16,026 INFO L78 Accepts]: Start accepts. Automaton has 13487 states and 41624 transitions. Word has length 55 [2019-12-18 21:12:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 13487 states and 41624 transitions. [2019-12-18 21:12:16,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:12:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13487 states and 41624 transitions. [2019-12-18 21:12:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:16,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:16,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:16,043 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 483812939, now seen corresponding path program 3 times [2019-12-18 21:12:16,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:16,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644626345] [2019-12-18 21:12:16,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:16,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644626345] [2019-12-18 21:12:16,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:16,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:12:16,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306532500] [2019-12-18 21:12:16,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:12:16,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:12:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:12:16,225 INFO L87 Difference]: Start difference. First operand 13487 states and 41624 transitions. Second operand 10 states. [2019-12-18 21:12:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:19,135 INFO L93 Difference]: Finished difference Result 28176 states and 83577 transitions. [2019-12-18 21:12:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 21:12:19,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 21:12:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:19,174 INFO L225 Difference]: With dead ends: 28176 [2019-12-18 21:12:19,175 INFO L226 Difference]: Without dead ends: 27960 [2019-12-18 21:12:19,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 21:12:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27960 states. [2019-12-18 21:12:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27960 to 16147. [2019-12-18 21:12:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16147 states. [2019-12-18 21:12:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16147 states to 16147 states and 49608 transitions. [2019-12-18 21:12:19,495 INFO L78 Accepts]: Start accepts. Automaton has 16147 states and 49608 transitions. Word has length 55 [2019-12-18 21:12:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:19,496 INFO L462 AbstractCegarLoop]: Abstraction has 16147 states and 49608 transitions. [2019-12-18 21:12:19,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:12:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16147 states and 49608 transitions. [2019-12-18 21:12:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:19,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:19,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:19,514 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash -546465397, now seen corresponding path program 4 times [2019-12-18 21:12:19,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:19,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108337614] [2019-12-18 21:12:19,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:19,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108337614] [2019-12-18 21:12:19,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:19,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:12:19,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487098671] [2019-12-18 21:12:19,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:19,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:19,608 INFO L87 Difference]: Start difference. First operand 16147 states and 49608 transitions. Second operand 5 states. [2019-12-18 21:12:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:20,099 INFO L93 Difference]: Finished difference Result 22094 states and 66683 transitions. [2019-12-18 21:12:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:12:20,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:12:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:20,130 INFO L225 Difference]: With dead ends: 22094 [2019-12-18 21:12:20,130 INFO L226 Difference]: Without dead ends: 21996 [2019-12-18 21:12:20,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21996 states. [2019-12-18 21:12:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21996 to 17348. [2019-12-18 21:12:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17348 states. [2019-12-18 21:12:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17348 states to 17348 states and 53082 transitions. [2019-12-18 21:12:20,409 INFO L78 Accepts]: Start accepts. Automaton has 17348 states and 53082 transitions. Word has length 55 [2019-12-18 21:12:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:20,409 INFO L462 AbstractCegarLoop]: Abstraction has 17348 states and 53082 transitions. [2019-12-18 21:12:20,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17348 states and 53082 transitions. [2019-12-18 21:12:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:12:20,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:20,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:20,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1194468433, now seen corresponding path program 5 times [2019-12-18 21:12:20,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:20,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724077208] [2019-12-18 21:12:20,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:20,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724077208] [2019-12-18 21:12:20,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:20,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:20,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414676755] [2019-12-18 21:12:20,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:20,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:20,499 INFO L87 Difference]: Start difference. First operand 17348 states and 53082 transitions. Second operand 3 states. [2019-12-18 21:12:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:20,577 INFO L93 Difference]: Finished difference Result 17346 states and 53077 transitions. [2019-12-18 21:12:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:12:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:20,608 INFO L225 Difference]: With dead ends: 17346 [2019-12-18 21:12:20,609 INFO L226 Difference]: Without dead ends: 17346 [2019-12-18 21:12:20,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17346 states. [2019-12-18 21:12:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17346 to 14357. [2019-12-18 21:12:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14357 states. [2019-12-18 21:12:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14357 states to 14357 states and 44813 transitions. [2019-12-18 21:12:20,856 INFO L78 Accepts]: Start accepts. Automaton has 14357 states and 44813 transitions. Word has length 55 [2019-12-18 21:12:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:20,857 INFO L462 AbstractCegarLoop]: Abstraction has 14357 states and 44813 transitions. [2019-12-18 21:12:20,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14357 states and 44813 transitions. [2019-12-18 21:12:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:20,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:20,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:20,872 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash 120766202, now seen corresponding path program 1 times [2019-12-18 21:12:20,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:20,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828817251] [2019-12-18 21:12:20,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:21,349 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 12 [2019-12-18 21:12:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:21,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828817251] [2019-12-18 21:12:21,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:21,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:12:21,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576606441] [2019-12-18 21:12:21,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:12:21,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:12:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:21,453 INFO L87 Difference]: Start difference. First operand 14357 states and 44813 transitions. Second operand 14 states. [2019-12-18 21:12:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:24,735 INFO L93 Difference]: Finished difference Result 23464 states and 71662 transitions. [2019-12-18 21:12:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 21:12:24,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 21:12:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:24,774 INFO L225 Difference]: With dead ends: 23464 [2019-12-18 21:12:24,775 INFO L226 Difference]: Without dead ends: 20954 [2019-12-18 21:12:24,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 21:12:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20954 states. [2019-12-18 21:12:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20954 to 14647. [2019-12-18 21:12:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-18 21:12:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 45503 transitions. [2019-12-18 21:12:25,039 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 45503 transitions. Word has length 56 [2019-12-18 21:12:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:25,039 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 45503 transitions. [2019-12-18 21:12:25,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:12:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 45503 transitions. [2019-12-18 21:12:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:25,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:25,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:25,054 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 881849154, now seen corresponding path program 2 times [2019-12-18 21:12:25,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:25,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61025831] [2019-12-18 21:12:25,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61025831] [2019-12-18 21:12:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:12:25,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71554906] [2019-12-18 21:12:25,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:12:25,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:12:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:12:25,309 INFO L87 Difference]: Start difference. First operand 14647 states and 45503 transitions. Second operand 11 states. [2019-12-18 21:12:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:26,801 INFO L93 Difference]: Finished difference Result 32228 states and 100567 transitions. [2019-12-18 21:12:26,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 21:12:26,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 21:12:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:26,846 INFO L225 Difference]: With dead ends: 32228 [2019-12-18 21:12:26,846 INFO L226 Difference]: Without dead ends: 30830 [2019-12-18 21:12:26,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:12:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30830 states. [2019-12-18 21:12:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30830 to 18717. [2019-12-18 21:12:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18717 states. [2019-12-18 21:12:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18717 states to 18717 states and 58602 transitions. [2019-12-18 21:12:27,482 INFO L78 Accepts]: Start accepts. Automaton has 18717 states and 58602 transitions. Word has length 56 [2019-12-18 21:12:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:27,483 INFO L462 AbstractCegarLoop]: Abstraction has 18717 states and 58602 transitions. [2019-12-18 21:12:27,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:12:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 18717 states and 58602 transitions. [2019-12-18 21:12:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:27,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:27,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:27,504 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1612640318, now seen corresponding path program 3 times [2019-12-18 21:12:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612436508] [2019-12-18 21:12:27,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:27,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612436508] [2019-12-18 21:12:27,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:27,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:12:27,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028549795] [2019-12-18 21:12:27,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:12:27,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:27,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:12:27,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:12:27,975 INFO L87 Difference]: Start difference. First operand 18717 states and 58602 transitions. Second operand 12 states. [2019-12-18 21:12:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:30,911 INFO L93 Difference]: Finished difference Result 27133 states and 83409 transitions. [2019-12-18 21:12:30,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 21:12:30,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 21:12:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:30,949 INFO L225 Difference]: With dead ends: 27133 [2019-12-18 21:12:30,950 INFO L226 Difference]: Without dead ends: 25799 [2019-12-18 21:12:30,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 21:12:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25799 states. [2019-12-18 21:12:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25799 to 18754. [2019-12-18 21:12:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-12-18 21:12:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 58667 transitions. [2019-12-18 21:12:31,276 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 58667 transitions. Word has length 56 [2019-12-18 21:12:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:31,276 INFO L462 AbstractCegarLoop]: Abstraction has 18754 states and 58667 transitions. [2019-12-18 21:12:31,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:12:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 58667 transitions. [2019-12-18 21:12:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:31,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:31,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:31,296 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1758322932, now seen corresponding path program 4 times [2019-12-18 21:12:31,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:31,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814163207] [2019-12-18 21:12:31,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:32,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814163207] [2019-12-18 21:12:32,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:32,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:12:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696428205] [2019-12-18 21:12:32,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:12:32,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:12:32,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:12:32,078 INFO L87 Difference]: Start difference. First operand 18754 states and 58667 transitions. Second operand 17 states. [2019-12-18 21:12:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:35,097 INFO L93 Difference]: Finished difference Result 27113 states and 83333 transitions. [2019-12-18 21:12:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 21:12:35,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 21:12:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:35,137 INFO L225 Difference]: With dead ends: 27113 [2019-12-18 21:12:35,137 INFO L226 Difference]: Without dead ends: 25911 [2019-12-18 21:12:35,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 21:12:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25911 states. [2019-12-18 21:12:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25911 to 19034. [2019-12-18 21:12:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19034 states. [2019-12-18 21:12:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19034 states to 19034 states and 59405 transitions. [2019-12-18 21:12:35,480 INFO L78 Accepts]: Start accepts. Automaton has 19034 states and 59405 transitions. Word has length 56 [2019-12-18 21:12:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:35,480 INFO L462 AbstractCegarLoop]: Abstraction has 19034 states and 59405 transitions. [2019-12-18 21:12:35,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:12:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19034 states and 59405 transitions. [2019-12-18 21:12:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:35,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:35,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:35,507 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 97437898, now seen corresponding path program 5 times [2019-12-18 21:12:35,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:35,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837849090] [2019-12-18 21:12:35,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:35,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837849090] [2019-12-18 21:12:35,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:35,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:12:35,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729989920] [2019-12-18 21:12:35,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 21:12:35,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 21:12:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:12:35,993 INFO L87 Difference]: Start difference. First operand 19034 states and 59405 transitions. Second operand 16 states. [2019-12-18 21:12:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:38,957 INFO L93 Difference]: Finished difference Result 26655 states and 81784 transitions. [2019-12-18 21:12:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 21:12:38,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 21:12:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:39,007 INFO L225 Difference]: With dead ends: 26655 [2019-12-18 21:12:39,008 INFO L226 Difference]: Without dead ends: 26149 [2019-12-18 21:12:39,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 21:12:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26149 states. [2019-12-18 21:12:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26149 to 18990. [2019-12-18 21:12:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18990 states. [2019-12-18 21:12:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18990 states to 18990 states and 59280 transitions. [2019-12-18 21:12:39,345 INFO L78 Accepts]: Start accepts. Automaton has 18990 states and 59280 transitions. Word has length 56 [2019-12-18 21:12:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:39,345 INFO L462 AbstractCegarLoop]: Abstraction has 18990 states and 59280 transitions. [2019-12-18 21:12:39,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 21:12:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18990 states and 59280 transitions. [2019-12-18 21:12:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:39,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:39,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:39,365 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -362811248, now seen corresponding path program 6 times [2019-12-18 21:12:39,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:39,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735941417] [2019-12-18 21:12:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:39,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735941417] [2019-12-18 21:12:39,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:39,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:12:39,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83411373] [2019-12-18 21:12:39,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:12:39,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:12:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:12:39,660 INFO L87 Difference]: Start difference. First operand 18990 states and 59280 transitions. Second operand 12 states. [2019-12-18 21:12:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:41,836 INFO L93 Difference]: Finished difference Result 25619 states and 79425 transitions. [2019-12-18 21:12:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:12:41,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 21:12:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:41,872 INFO L225 Difference]: With dead ends: 25619 [2019-12-18 21:12:41,872 INFO L226 Difference]: Without dead ends: 23005 [2019-12-18 21:12:41,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:12:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23005 states. [2019-12-18 21:12:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23005 to 18340. [2019-12-18 21:12:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18340 states. [2019-12-18 21:12:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18340 states to 18340 states and 57506 transitions. [2019-12-18 21:12:42,186 INFO L78 Accepts]: Start accepts. Automaton has 18340 states and 57506 transitions. Word has length 56 [2019-12-18 21:12:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:42,187 INFO L462 AbstractCegarLoop]: Abstraction has 18340 states and 57506 transitions. [2019-12-18 21:12:42,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:12:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 18340 states and 57506 transitions. [2019-12-18 21:12:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:42,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:42,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:42,206 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1251297094, now seen corresponding path program 7 times [2019-12-18 21:12:42,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:42,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020556991] [2019-12-18 21:12:42,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:42,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020556991] [2019-12-18 21:12:42,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:42,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:12:42,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003016380] [2019-12-18 21:12:42,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:12:42,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:12:42,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:12:42,715 INFO L87 Difference]: Start difference. First operand 18340 states and 57506 transitions. Second operand 17 states. [2019-12-18 21:12:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:47,582 INFO L93 Difference]: Finished difference Result 27667 states and 84027 transitions. [2019-12-18 21:12:47,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 21:12:47,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 21:12:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:47,623 INFO L225 Difference]: With dead ends: 27667 [2019-12-18 21:12:47,623 INFO L226 Difference]: Without dead ends: 25944 [2019-12-18 21:12:47,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=533, Invalid=2889, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 21:12:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25944 states. [2019-12-18 21:12:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25944 to 18540. [2019-12-18 21:12:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18540 states. [2019-12-18 21:12:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18540 states to 18540 states and 57957 transitions. [2019-12-18 21:12:48,221 INFO L78 Accepts]: Start accepts. Automaton has 18540 states and 57957 transitions. Word has length 56 [2019-12-18 21:12:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:48,221 INFO L462 AbstractCegarLoop]: Abstraction has 18540 states and 57957 transitions. [2019-12-18 21:12:48,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:12:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18540 states and 57957 transitions. [2019-12-18 21:12:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:48,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:48,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:48,241 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash -516628646, now seen corresponding path program 1 times [2019-12-18 21:12:48,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:48,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445828577] [2019-12-18 21:12:48,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:48,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445828577] [2019-12-18 21:12:48,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:48,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:48,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046345742] [2019-12-18 21:12:48,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:48,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:48,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:48,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:48,292 INFO L87 Difference]: Start difference. First operand 18540 states and 57957 transitions. Second operand 3 states. [2019-12-18 21:12:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:48,406 INFO L93 Difference]: Finished difference Result 19348 states and 57755 transitions. [2019-12-18 21:12:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:48,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:12:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:48,441 INFO L225 Difference]: With dead ends: 19348 [2019-12-18 21:12:48,441 INFO L226 Difference]: Without dead ends: 19348 [2019-12-18 21:12:48,444 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 21:12:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2019-12-18 21:12:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 18436. [2019-12-18 21:12:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18436 states. [2019-12-18 21:12:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18436 states to 18436 states and 55167 transitions. [2019-12-18 21:12:48,761 INFO L78 Accepts]: Start accepts. Automaton has 18436 states and 55167 transitions. Word has length 56 [2019-12-18 21:12:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:48,761 INFO L462 AbstractCegarLoop]: Abstraction has 18436 states and 55167 transitions. [2019-12-18 21:12:48,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18436 states and 55167 transitions. [2019-12-18 21:12:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:48,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:48,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:48,782 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash 39467578, now seen corresponding path program 8 times [2019-12-18 21:12:48,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:48,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928922407] [2019-12-18 21:12:48,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:49,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928922407] [2019-12-18 21:12:49,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:49,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:12:49,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524293632] [2019-12-18 21:12:49,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:12:49,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:12:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:12:49,021 INFO L87 Difference]: Start difference. First operand 18436 states and 55167 transitions. Second operand 11 states. [2019-12-18 21:12:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:50,083 INFO L93 Difference]: Finished difference Result 31023 states and 92621 transitions. [2019-12-18 21:12:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:12:50,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 21:12:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:50,131 INFO L225 Difference]: With dead ends: 31023 [2019-12-18 21:12:50,131 INFO L226 Difference]: Without dead ends: 30713 [2019-12-18 21:12:50,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:12:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30713 states. [2019-12-18 21:12:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30713 to 17984. [2019-12-18 21:12:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17984 states. [2019-12-18 21:12:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17984 states to 17984 states and 54111 transitions. [2019-12-18 21:12:50,505 INFO L78 Accepts]: Start accepts. Automaton has 17984 states and 54111 transitions. Word has length 56 [2019-12-18 21:12:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:50,506 INFO L462 AbstractCegarLoop]: Abstraction has 17984 states and 54111 transitions. [2019-12-18 21:12:50,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:12:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 17984 states and 54111 transitions. [2019-12-18 21:12:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:50,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:50,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:50,526 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1839945402, now seen corresponding path program 9 times [2019-12-18 21:12:50,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:50,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318907974] [2019-12-18 21:12:50,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318907974] [2019-12-18 21:12:50,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:50,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:12:50,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647551136] [2019-12-18 21:12:50,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:12:50,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:12:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:12:50,743 INFO L87 Difference]: Start difference. First operand 17984 states and 54111 transitions. Second operand 11 states. [2019-12-18 21:12:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:51,721 INFO L93 Difference]: Finished difference Result 28565 states and 84947 transitions. [2019-12-18 21:12:51,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:12:51,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 21:12:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:51,753 INFO L225 Difference]: With dead ends: 28565 [2019-12-18 21:12:51,753 INFO L226 Difference]: Without dead ends: 22086 [2019-12-18 21:12:51,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:12:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22086 states. [2019-12-18 21:12:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22086 to 14221. [2019-12-18 21:12:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14221 states. [2019-12-18 21:12:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14221 states to 14221 states and 42728 transitions. [2019-12-18 21:12:52,042 INFO L78 Accepts]: Start accepts. Automaton has 14221 states and 42728 transitions. Word has length 56 [2019-12-18 21:12:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:52,043 INFO L462 AbstractCegarLoop]: Abstraction has 14221 states and 42728 transitions. [2019-12-18 21:12:52,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:12:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14221 states and 42728 transitions. [2019-12-18 21:12:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:12:52,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:52,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:52,059 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:12:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1135634574, now seen corresponding path program 10 times [2019-12-18 21:12:52,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:52,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050131846] [2019-12-18 21:12:52,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:12:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:12:52,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:12:52,156 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:12:52,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~a~0_9) (= v_~x$r_buff1_thd2~0_17 0) (= v_~main$tmp_guard1~0_18 0) (= v_~x$w_buff1_used~0_63 0) (= v_~x$r_buff1_thd0~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_20) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= v_~x~0_24 0) (= v_~main$tmp_guard0~0_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~z~0_7) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_39 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= 0 v_~__unbuffered_p2_EAX~0_10) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= 0 v_~x$w_buff0_used~0_109) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd3~0_17 0) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice2~0_31) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~a~0=v_~a~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_17, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:12:52,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:12:52,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-18 21:12:52,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 v_~x$w_buff0~0_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:12:52,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In181544036 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In181544036 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out181544036| ~x~0_In181544036)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out181544036| ~x$w_buff1~0_In181544036)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In181544036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In181544036, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In181544036, ~x~0=~x~0_In181544036} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out181544036|, ~x$w_buff1~0=~x$w_buff1~0_In181544036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In181544036, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In181544036, ~x~0=~x~0_In181544036} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 21:12:52,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In48480105 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In48480105 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out48480105|)) (and (= ~x$w_buff0_used~0_In48480105 |P1Thread1of1ForFork1_#t~ite28_Out48480105|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In48480105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In48480105, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out48480105|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:12:52,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= |v_P2Thread1of1ForFork2_#t~ite32_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-18 21:12:52,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2087395963 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2087395963 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out-2087395963| ~x$w_buff0_used~0_In-2087395963) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out-2087395963| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2087395963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2087395963} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-2087395963|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2087395963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2087395963} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 21:12:52,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In369888164 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In369888164 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In369888164 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In369888164 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out369888164|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In369888164 |P2Thread1of1ForFork2_#t~ite35_Out369888164|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In369888164, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369888164, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369888164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369888164} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out369888164|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In369888164, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369888164, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369888164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369888164} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 21:12:52,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In732954392 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In732954392 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In732954392 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In732954392 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out732954392|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out732954392| ~x$w_buff1_used~0_In732954392) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In732954392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In732954392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In732954392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732954392} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out732954392|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732954392, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In732954392, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In732954392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732954392} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:12:52,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2009354628 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2009354628 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In2009354628 ~x$r_buff0_thd2~0_Out2009354628)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out2009354628)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2009354628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2009354628} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2009354628|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2009354628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2009354628} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:12:52,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2078550954 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2078550954 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2078550954 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-2078550954 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-2078550954|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-2078550954 |P1Thread1of1ForFork1_#t~ite31_Out-2078550954|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2078550954, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2078550954, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2078550954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078550954} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2078550954|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2078550954, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2078550954, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2078550954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078550954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:12:52,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:12:52,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-562628134 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite11_Out-562628134| |P0Thread1of1ForFork0_#t~ite12_Out-562628134|) (= ~x$w_buff1~0_In-562628134 |P0Thread1of1ForFork0_#t~ite11_Out-562628134|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-562628134 256)))) (or (= (mod ~x$w_buff0_used~0_In-562628134 256) 0) (and (= (mod ~x$w_buff1_used~0_In-562628134 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-562628134 256) 0))))) (and (= ~x$w_buff1~0_In-562628134 |P0Thread1of1ForFork0_#t~ite12_Out-562628134|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-562628134| |P0Thread1of1ForFork0_#t~ite11_Out-562628134|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-562628134|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-562628134, ~x$w_buff1~0=~x$w_buff1~0_In-562628134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-562628134, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-562628134, ~weak$$choice2~0=~weak$$choice2~0_In-562628134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-562628134} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-562628134|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-562628134, ~x$w_buff1~0=~x$w_buff1~0_In-562628134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-562628134, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-562628134, ~weak$$choice2~0=~weak$$choice2~0_In-562628134, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-562628134|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-562628134} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:12:52,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L746-->L746-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-23433770 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-23433770| |P0Thread1of1ForFork0_#t~ite14_Out-23433770|) (= ~x$w_buff0_used~0_In-23433770 |P0Thread1of1ForFork0_#t~ite14_Out-23433770|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-23433770 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-23433770 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-23433770 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-23433770 256))))) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite15_Out-23433770| ~x$w_buff0_used~0_In-23433770) (= |P0Thread1of1ForFork0_#t~ite14_In-23433770| |P0Thread1of1ForFork0_#t~ite14_Out-23433770|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-23433770, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-23433770, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-23433770, ~weak$$choice2~0=~weak$$choice2~0_In-23433770, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-23433770|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-23433770} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-23433770, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-23433770, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-23433770, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-23433770|, ~weak$$choice2~0=~weak$$choice2~0_In-23433770, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-23433770|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-23433770} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:12:52,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_45 v_~x$r_buff0_thd1~0_44) (not (= (mod v_~weak$$choice2~0_19 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:12:52,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~x$mem_tmp~0_5 v_~x~0_19) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 21:12:52,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-203423123 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-203423123 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out-203423123| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out-203423123| ~x$r_buff0_thd3~0_In-203423123) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-203423123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203423123} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-203423123|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-203423123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203423123} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 21:12:52,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-865062861 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-865062861 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-865062861 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-865062861 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite37_Out-865062861| ~x$r_buff1_thd3~0_In-865062861) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-865062861|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-865062861, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-865062861, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-865062861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865062861} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-865062861|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-865062861, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-865062861, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-865062861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865062861} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 21:12:52,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~x$r_buff1_thd3~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:12:52,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:12:52,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-286330630 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-286330630 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-286330630| ~x~0_In-286330630)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-286330630 |ULTIMATE.start_main_#t~ite41_Out-286330630|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-286330630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-286330630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-286330630, ~x~0=~x~0_In-286330630} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-286330630|, ~x$w_buff1~0=~x$w_buff1~0_In-286330630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-286330630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-286330630, ~x~0=~x~0_In-286330630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:12:52,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 21:12:52,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-363527684 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-363527684 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-363527684| ~x$w_buff0_used~0_In-363527684)) (and (= |ULTIMATE.start_main_#t~ite43_Out-363527684| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363527684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363527684} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-363527684, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-363527684|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363527684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:12:52,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In329280694 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In329280694 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In329280694 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In329280694 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out329280694|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out329280694| ~x$w_buff1_used~0_In329280694) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In329280694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In329280694, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In329280694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In329280694} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In329280694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In329280694, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In329280694, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out329280694|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In329280694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:12:52,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In271851128 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In271851128 256)))) (or (and (= ~x$r_buff0_thd0~0_In271851128 |ULTIMATE.start_main_#t~ite45_Out271851128|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out271851128| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In271851128, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271851128} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In271851128, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out271851128|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271851128} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:12:52,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1267950181 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1267950181 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1267950181 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1267950181 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1267950181| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In1267950181 |ULTIMATE.start_main_#t~ite46_Out1267950181|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1267950181, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1267950181, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1267950181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267950181} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1267950181, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1267950181|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1267950181, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1267950181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267950181} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:12:52,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_15 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_8 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:12:52,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:12:52 BasicIcfg [2019-12-18 21:12:52,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:12:52,279 INFO L168 Benchmark]: Toolchain (without parser) took 83157.92 ms. Allocated memory was 136.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 100.1 MB in the beginning and 570.8 MB in the end (delta: -470.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,280 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.15 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 154.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.31 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,281 INFO L168 Benchmark]: Boogie Preprocessor took 42.09 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,282 INFO L168 Benchmark]: RCFGBuilder took 847.32 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 101.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,282 INFO L168 Benchmark]: TraceAbstraction took 81442.55 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 570.8 MB in the end (delta: -469.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:12:52,285 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.46 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.15 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 154.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.31 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.09 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.32 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 101.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81442.55 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 570.8 MB in the end (delta: -469.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 166 ProgramPointsBefore, 86 ProgramPointsAfterwards, 197 TransitionsBefore, 96 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 6251 VarBasedMoverChecksPositive, 206 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 71962 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5417 SDtfs, 7939 SDslu, 22145 SDs, 0 SdLazy, 21928 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3378 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101822occurred 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: 19.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 131295 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 300585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...