/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:59:20,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:59:20,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:59:20,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:59:20,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:59:20,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:59:20,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:59:20,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:59:20,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:59:20,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:59:20,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:59:20,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:59:20,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:59:20,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:59:20,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:59:20,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:59:20,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:59:20,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:59:20,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:59:20,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:59:20,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:59:20,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:59:20,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:59:20,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:59:20,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:59:20,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:59:20,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:59:20,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:59:20,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:59:20,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:59:20,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:59:20,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:59:20,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:59:20,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:59:20,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:59:20,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:59:20,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:59:20,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:59:20,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:59:20,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:59:20,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:59:20,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:59:20,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:59:20,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:59:20,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:59:20,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:59:20,923 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:59:20,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:59:20,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:59:20,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:59:20,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:59:20,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:59:20,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:59:20,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:59:20,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:59:20,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:59:20,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:59:20,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:59:20,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:59:20,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:59:20,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:59:20,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:59:20,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:59:20,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:59:20,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:59:20,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:59:20,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:59:20,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:59:20,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:59:20,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:59:20,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:59:21,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:59:21,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:59:21,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:59:21,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:59:21,231 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:59:21,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-18 16:59:21,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458351812/659ed9c42e3745cf82fdd49f1428d37d/FLAGc34198e06 [2019-12-18 16:59:21,871 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:59:21,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-18 16:59:21,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458351812/659ed9c42e3745cf82fdd49f1428d37d/FLAGc34198e06 [2019-12-18 16:59:22,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458351812/659ed9c42e3745cf82fdd49f1428d37d [2019-12-18 16:59:22,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:59:22,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:59:22,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:59:22,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:59:22,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:59:22,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:59:22" (1/1) ... [2019-12-18 16:59:22,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e380f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:22, skipping insertion in model container [2019-12-18 16:59:22,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:59:22" (1/1) ... [2019-12-18 16:59:22,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:59:22,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:59:22,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:59:22,988 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:59:23,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:59:23,146 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:59:23,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23 WrapperNode [2019-12-18 16:59:23,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:59:23,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:59:23,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:59:23,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:59:23,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:59:23,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:59:23,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:59:23,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:59:23,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... [2019-12-18 16:59:23,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:59:23,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:59:23,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:59:23,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:59:23,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:59:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:59:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:59:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:59:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:59:23,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:59:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:59:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:59:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:59:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:59:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:59:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:59:23,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:59:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:59:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:59:23,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:59:23,341 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 16:59:24,111 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:59:24,112 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:59:24,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:59:24 BoogieIcfgContainer [2019-12-18 16:59:24,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:59:24,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:59:24,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:59:24,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:59:24,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:59:22" (1/3) ... [2019-12-18 16:59:24,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47928d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:59:24, skipping insertion in model container [2019-12-18 16:59:24,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:59:23" (2/3) ... [2019-12-18 16:59:24,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47928d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:59:24, skipping insertion in model container [2019-12-18 16:59:24,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:59:24" (3/3) ... [2019-12-18 16:59:24,126 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2019-12-18 16:59:24,137 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:59:24,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:59:24,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:59:24,148 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:59:24,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,201 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,202 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,271 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,271 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,283 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,285 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:59:24,320 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:59:24,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:59:24,337 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:59:24,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:59:24,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:59:24,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:59:24,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:59:24,338 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:59:24,338 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:59:24,353 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 16:59:24,355 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 16:59:24,444 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 16:59:24,444 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:59:24,465 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:59:24,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 16:59:24,543 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 16:59:24,544 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:59:24,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:59:24,573 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:59:24,574 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:59:30,378 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 16:59:30,505 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 16:59:30,538 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-18 16:59:30,538 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 16:59:30,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 17:00:09,331 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-18 17:00:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-18 17:00:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:00:09,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:09,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:09,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-18 17:00:09,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:09,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172211265] [2019-12-18 17:00:09,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:09,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172211265] [2019-12-18 17:00:09,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:09,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:00:09,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196218169] [2019-12-18 17:00:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:00:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:00:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:09,611 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-18 17:00:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:14,470 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-18 17:00:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:00:14,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:00:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:15,531 INFO L225 Difference]: With dead ends: 169554 [2019-12-18 17:00:15,531 INFO L226 Difference]: Without dead ends: 159076 [2019-12-18 17:00:15,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:00:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-18 17:00:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-18 17:00:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-18 17:00:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-18 17:00:35,978 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-18 17:00:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:00:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-18 17:00:35,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:00:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-18 17:00:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:00:35,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:00:35,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:00:35,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:00:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:00:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-18 17:00:35,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:00:35,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869157983] [2019-12-18 17:00:35,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:00:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:00:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:00:36,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869157983] [2019-12-18 17:00:36,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:00:36,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:00:36,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200648624] [2019-12-18 17:00:36,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:00:36,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:00:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:00:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:00:36,157 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-18 17:00:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:00:39,223 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-18 17:00:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:00:39,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:00:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:00:48,014 INFO L225 Difference]: With dead ends: 251868 [2019-12-18 17:00:48,014 INFO L226 Difference]: Without dead ends: 251658 [2019-12-18 17:00:48,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:00:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-18 17:01:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-18 17:01:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-18 17:01:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-18 17:01:02,399 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-18 17:01:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:02,399 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-18 17:01:02,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-18 17:01:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:01:02,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:02,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:02,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-18 17:01:02,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:02,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854339750] [2019-12-18 17:01:02,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:02,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854339750] [2019-12-18 17:01:02,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:02,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:02,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689195567] [2019-12-18 17:01:02,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:02,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:02,500 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-18 17:01:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:11,095 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-18 17:01:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:11,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:01:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:11,615 INFO L225 Difference]: With dead ends: 146539 [2019-12-18 17:01:11,615 INFO L226 Difference]: Without dead ends: 146539 [2019-12-18 17:01:11,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-18 17:01:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-18 17:01:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-18 17:01:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-18 17:01:18,406 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-18 17:01:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:18,407 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-18 17:01:18,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-18 17:01:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:01:18,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:18,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:18,414 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-18 17:01:18,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:18,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455829743] [2019-12-18 17:01:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:18,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455829743] [2019-12-18 17:01:18,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:18,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:18,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243867899] [2019-12-18 17:01:18,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:18,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:18,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:18,510 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-18 17:01:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:18,741 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-18 17:01:18,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:01:18,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:01:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:20,042 INFO L225 Difference]: With dead ends: 40251 [2019-12-18 17:01:20,043 INFO L226 Difference]: Without dead ends: 40251 [2019-12-18 17:01:20,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-18 17:01:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-18 17:01:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-18 17:01:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-18 17:01:20,784 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-18 17:01:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:20,785 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-18 17:01:20,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-18 17:01:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:01:20,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:20,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:20,787 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-18 17:01:20,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:20,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562222297] [2019-12-18 17:01:20,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:20,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562222297] [2019-12-18 17:01:20,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:20,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:20,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233922627] [2019-12-18 17:01:20,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:20,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:20,881 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-18 17:01:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:21,448 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-18 17:01:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:01:21,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 17:01:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:21,565 INFO L225 Difference]: With dead ends: 58215 [2019-12-18 17:01:21,565 INFO L226 Difference]: Without dead ends: 58197 [2019-12-18 17:01:21,565 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 17:01:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-18 17:01:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-18 17:01:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-18 17:01:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-18 17:01:22,902 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-18 17:01:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:22,902 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-18 17:01:22,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-18 17:01:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:01:22,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:22,922 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] [2019-12-18 17:01:22,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-18 17:01:22,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:22,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420637770] [2019-12-18 17:01:22,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:23,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420637770] [2019-12-18 17:01:23,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:23,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:23,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647186923] [2019-12-18 17:01:23,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:23,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:23,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:23,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:23,087 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-18 17:01:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:24,087 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-18 17:01:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:01:24,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 17:01:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:24,669 INFO L225 Difference]: With dead ends: 73096 [2019-12-18 17:01:24,670 INFO L226 Difference]: Without dead ends: 73066 [2019-12-18 17:01:24,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-18 17:01:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-18 17:01:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-18 17:01:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-18 17:01:25,648 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-18 17:01:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:25,649 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-18 17:01:25,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-18 17:01:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:01:25,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:25,663 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] [2019-12-18 17:01:25,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-18 17:01:25,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:25,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512682531] [2019-12-18 17:01:25,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:25,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512682531] [2019-12-18 17:01:25,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:25,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:25,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440638812] [2019-12-18 17:01:25,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:25,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:25,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:25,790 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-18 17:01:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:27,108 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-18 17:01:27,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:01:27,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 17:01:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:27,262 INFO L225 Difference]: With dead ends: 73479 [2019-12-18 17:01:27,263 INFO L226 Difference]: Without dead ends: 73449 [2019-12-18 17:01:27,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:01:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-18 17:01:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-18 17:01:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-18 17:01:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-18 17:01:31,834 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-18 17:01:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:31,835 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-18 17:01:31,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-18 17:01:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:01:31,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:31,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:31,864 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-18 17:01:31,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:31,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403166263] [2019-12-18 17:01:31,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:31,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403166263] [2019-12-18 17:01:31,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:31,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:01:31,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970686630] [2019-12-18 17:01:31,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:31,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:31,925 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-18 17:01:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:32,065 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-18 17:01:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:01:32,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:01:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:32,114 INFO L225 Difference]: With dead ends: 26235 [2019-12-18 17:01:32,114 INFO L226 Difference]: Without dead ends: 26235 [2019-12-18 17:01:32,114 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 17:01:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-18 17:01:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-18 17:01:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 17:01:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-18 17:01:32,578 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-18 17:01:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:32,578 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-18 17:01:32,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-18 17:01:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:01:32,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:32,627 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] [2019-12-18 17:01:32,627 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-18 17:01:32,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:32,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020498744] [2019-12-18 17:01:32,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:32,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020498744] [2019-12-18 17:01:32,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:32,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:32,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166475298] [2019-12-18 17:01:32,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:01:32,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:01:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:01:32,726 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 4 states. [2019-12-18 17:01:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:32,971 INFO L93 Difference]: Finished difference Result 37412 states and 127885 transitions. [2019-12-18 17:01:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:01:32,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:01:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:33,052 INFO L225 Difference]: With dead ends: 37412 [2019-12-18 17:01:33,052 INFO L226 Difference]: Without dead ends: 26234 [2019-12-18 17:01:33,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26234 states. [2019-12-18 17:01:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26234 to 26084. [2019-12-18 17:01:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26084 states. [2019-12-18 17:01:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26084 states to 26084 states and 92286 transitions. [2019-12-18 17:01:33,911 INFO L78 Accepts]: Start accepts. Automaton has 26084 states and 92286 transitions. Word has length 42 [2019-12-18 17:01:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:33,912 INFO L462 AbstractCegarLoop]: Abstraction has 26084 states and 92286 transitions. [2019-12-18 17:01:33,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:01:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26084 states and 92286 transitions. [2019-12-18 17:01:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:01:33,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:33,962 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] [2019-12-18 17:01:33,962 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-18 17:01:33,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:33,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141118184] [2019-12-18 17:01:33,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:34,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141118184] [2019-12-18 17:01:34,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:34,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:34,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326733448] [2019-12-18 17:01:34,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:34,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:34,025 INFO L87 Difference]: Start difference. First operand 26084 states and 92286 transitions. Second operand 3 states. [2019-12-18 17:01:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:34,227 INFO L93 Difference]: Finished difference Result 39452 states and 132645 transitions. [2019-12-18 17:01:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:34,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 17:01:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:34,301 INFO L225 Difference]: With dead ends: 39452 [2019-12-18 17:01:34,302 INFO L226 Difference]: Without dead ends: 26924 [2019-12-18 17:01:34,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-18 17:01:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 25835. [2019-12-18 17:01:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 17:01:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 79997 transitions. [2019-12-18 17:01:34,863 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 79997 transitions. Word has length 42 [2019-12-18 17:01:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:34,863 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 79997 transitions. [2019-12-18 17:01:34,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 79997 transitions. [2019-12-18 17:01:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 17:01:34,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:34,898 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] [2019-12-18 17:01:34,898 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-18 17:01:34,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:34,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562055660] [2019-12-18 17:01:34,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:34,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562055660] [2019-12-18 17:01:34,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:34,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:34,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117850358] [2019-12-18 17:01:34,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:34,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:34,997 INFO L87 Difference]: Start difference. First operand 25835 states and 79997 transitions. Second operand 6 states. [2019-12-18 17:01:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:35,139 INFO L93 Difference]: Finished difference Result 24507 states and 76659 transitions. [2019-12-18 17:01:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:01:35,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 17:01:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:35,156 INFO L225 Difference]: With dead ends: 24507 [2019-12-18 17:01:35,156 INFO L226 Difference]: Without dead ends: 10719 [2019-12-18 17:01:35,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10719 states. [2019-12-18 17:01:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10719 to 10341. [2019-12-18 17:01:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-12-18 17:01:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 32248 transitions. [2019-12-18 17:01:35,324 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 32248 transitions. Word has length 43 [2019-12-18 17:01:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:35,324 INFO L462 AbstractCegarLoop]: Abstraction has 10341 states and 32248 transitions. [2019-12-18 17:01:35,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 32248 transitions. [2019-12-18 17:01:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:35,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:35,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:35,343 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash -360004126, now seen corresponding path program 1 times [2019-12-18 17:01:35,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:35,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502215543] [2019-12-18 17:01:35,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:35,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502215543] [2019-12-18 17:01:35,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:35,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:35,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443453034] [2019-12-18 17:01:35,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:35,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:35,412 INFO L87 Difference]: Start difference. First operand 10341 states and 32248 transitions. Second operand 3 states. [2019-12-18 17:01:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:35,503 INFO L93 Difference]: Finished difference Result 13894 states and 42635 transitions. [2019-12-18 17:01:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:35,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:01:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:35,528 INFO L225 Difference]: With dead ends: 13894 [2019-12-18 17:01:35,529 INFO L226 Difference]: Without dead ends: 13894 [2019-12-18 17:01:35,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-12-18 17:01:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 11246. [2019-12-18 17:01:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-12-18 17:01:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35029 transitions. [2019-12-18 17:01:35,809 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 35029 transitions. Word has length 57 [2019-12-18 17:01:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:35,809 INFO L462 AbstractCegarLoop]: Abstraction has 11246 states and 35029 transitions. [2019-12-18 17:01:35,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 35029 transitions. [2019-12-18 17:01:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:35,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:35,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:35,822 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-18 17:01:35,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:35,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307478127] [2019-12-18 17:01:35,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:35,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307478127] [2019-12-18 17:01:35,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:35,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:01:35,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484798666] [2019-12-18 17:01:35,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:35,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:35,933 INFO L87 Difference]: Start difference. First operand 11246 states and 35029 transitions. Second operand 7 states. [2019-12-18 17:01:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:36,444 INFO L93 Difference]: Finished difference Result 31203 states and 96822 transitions. [2019-12-18 17:01:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:01:36,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:01:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:36,488 INFO L225 Difference]: With dead ends: 31203 [2019-12-18 17:01:36,488 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 17:01:36,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:01:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 17:01:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 14347. [2019-12-18 17:01:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-18 17:01:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 45043 transitions. [2019-12-18 17:01:36,796 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 45043 transitions. Word has length 57 [2019-12-18 17:01:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:36,797 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 45043 transitions. [2019-12-18 17:01:36,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 45043 transitions. [2019-12-18 17:01:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:36,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:36,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:36,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-18 17:01:36,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:36,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755952818] [2019-12-18 17:01:36,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:36,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755952818] [2019-12-18 17:01:36,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:36,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:36,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828921143] [2019-12-18 17:01:36,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:01:36,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:01:36,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:01:36,897 INFO L87 Difference]: Start difference. First operand 14347 states and 45043 transitions. Second operand 6 states. [2019-12-18 17:01:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:37,294 INFO L93 Difference]: Finished difference Result 36806 states and 112743 transitions. [2019-12-18 17:01:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:01:37,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 17:01:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:37,348 INFO L225 Difference]: With dead ends: 36806 [2019-12-18 17:01:37,349 INFO L226 Difference]: Without dead ends: 26675 [2019-12-18 17:01:37,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2019-12-18 17:01:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 16874. [2019-12-18 17:01:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16874 states. [2019-12-18 17:01:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16874 states to 16874 states and 52931 transitions. [2019-12-18 17:01:37,727 INFO L78 Accepts]: Start accepts. Automaton has 16874 states and 52931 transitions. Word has length 57 [2019-12-18 17:01:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:37,728 INFO L462 AbstractCegarLoop]: Abstraction has 16874 states and 52931 transitions. [2019-12-18 17:01:37,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:01:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 16874 states and 52931 transitions. [2019-12-18 17:01:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:37,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:37,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:37,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-18 17:01:37,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:37,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18059205] [2019-12-18 17:01:37,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:37,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18059205] [2019-12-18 17:01:37,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:37,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:01:37,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355142850] [2019-12-18 17:01:37,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:37,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:37,835 INFO L87 Difference]: Start difference. First operand 16874 states and 52931 transitions. Second operand 7 states. [2019-12-18 17:01:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:38,338 INFO L93 Difference]: Finished difference Result 29867 states and 90934 transitions. [2019-12-18 17:01:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:01:38,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:01:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:38,375 INFO L225 Difference]: With dead ends: 29867 [2019-12-18 17:01:38,375 INFO L226 Difference]: Without dead ends: 27808 [2019-12-18 17:01:38,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:01:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27808 states. [2019-12-18 17:01:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27808 to 16938. [2019-12-18 17:01:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 17:01:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 53162 transitions. [2019-12-18 17:01:38,716 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 53162 transitions. Word has length 57 [2019-12-18 17:01:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:38,717 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 53162 transitions. [2019-12-18 17:01:38,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 53162 transitions. [2019-12-18 17:01:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:38,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:38,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:38,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143536, now seen corresponding path program 1 times [2019-12-18 17:01:38,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:38,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461976464] [2019-12-18 17:01:38,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:38,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461976464] [2019-12-18 17:01:38,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:38,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:01:38,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162854830] [2019-12-18 17:01:38,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:38,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:38,780 INFO L87 Difference]: Start difference. First operand 16938 states and 53162 transitions. Second operand 3 states. [2019-12-18 17:01:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:38,892 INFO L93 Difference]: Finished difference Result 18741 states and 57074 transitions. [2019-12-18 17:01:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:38,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:01:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:38,926 INFO L225 Difference]: With dead ends: 18741 [2019-12-18 17:01:38,927 INFO L226 Difference]: Without dead ends: 18741 [2019-12-18 17:01:38,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-18 17:01:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 16938. [2019-12-18 17:01:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 17:01:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51972 transitions. [2019-12-18 17:01:39,232 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51972 transitions. Word has length 57 [2019-12-18 17:01:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:39,232 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51972 transitions. [2019-12-18 17:01:39,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51972 transitions. [2019-12-18 17:01:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:39,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:39,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:39,252 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-18 17:01:39,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:39,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396302857] [2019-12-18 17:01:39,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:39,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396302857] [2019-12-18 17:01:39,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:39,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:01:39,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784026152] [2019-12-18 17:01:39,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:39,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:39,328 INFO L87 Difference]: Start difference. First operand 16938 states and 51972 transitions. Second operand 7 states. [2019-12-18 17:01:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:39,702 INFO L93 Difference]: Finished difference Result 33067 states and 98644 transitions. [2019-12-18 17:01:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:01:39,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:01:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:39,741 INFO L225 Difference]: With dead ends: 33067 [2019-12-18 17:01:39,741 INFO L226 Difference]: Without dead ends: 27923 [2019-12-18 17:01:39,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:01:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27923 states. [2019-12-18 17:01:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27923 to 17148. [2019-12-18 17:01:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-18 17:01:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 52559 transitions. [2019-12-18 17:01:40,301 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 52559 transitions. Word has length 57 [2019-12-18 17:01:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:40,302 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 52559 transitions. [2019-12-18 17:01:40,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 52559 transitions. [2019-12-18 17:01:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:40,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:40,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:40,320 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-18 17:01:40,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:40,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856304242] [2019-12-18 17:01:40,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:40,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856304242] [2019-12-18 17:01:40,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:40,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:01:40,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888097560] [2019-12-18 17:01:40,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:01:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:01:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:01:40,397 INFO L87 Difference]: Start difference. First operand 17148 states and 52559 transitions. Second operand 5 states. [2019-12-18 17:01:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:40,924 INFO L93 Difference]: Finished difference Result 26314 states and 78268 transitions. [2019-12-18 17:01:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:01:40,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 17:01:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:40,960 INFO L225 Difference]: With dead ends: 26314 [2019-12-18 17:01:40,960 INFO L226 Difference]: Without dead ends: 26188 [2019-12-18 17:01:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26188 states. [2019-12-18 17:01:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26188 to 20073. [2019-12-18 17:01:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20073 states. [2019-12-18 17:01:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 61009 transitions. [2019-12-18 17:01:41,313 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 61009 transitions. Word has length 57 [2019-12-18 17:01:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:41,314 INFO L462 AbstractCegarLoop]: Abstraction has 20073 states and 61009 transitions. [2019-12-18 17:01:41,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:01:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 61009 transitions. [2019-12-18 17:01:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:41,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:41,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:41,338 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-18 17:01:41,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:41,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051596465] [2019-12-18 17:01:41,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:41,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051596465] [2019-12-18 17:01:41,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:41,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:01:41,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123766789] [2019-12-18 17:01:41,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:01:41,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:01:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:01:41,472 INFO L87 Difference]: Start difference. First operand 20073 states and 61009 transitions. Second operand 8 states. [2019-12-18 17:01:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:42,497 INFO L93 Difference]: Finished difference Result 27381 states and 81339 transitions. [2019-12-18 17:01:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:01:42,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 17:01:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:42,536 INFO L225 Difference]: With dead ends: 27381 [2019-12-18 17:01:42,537 INFO L226 Difference]: Without dead ends: 27381 [2019-12-18 17:01:42,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:01:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-18 17:01:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 20271. [2019-12-18 17:01:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20271 states. [2019-12-18 17:01:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 61591 transitions. [2019-12-18 17:01:42,901 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 61591 transitions. Word has length 57 [2019-12-18 17:01:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:42,902 INFO L462 AbstractCegarLoop]: Abstraction has 20271 states and 61591 transitions. [2019-12-18 17:01:42,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:01:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 61591 transitions. [2019-12-18 17:01:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:42,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:42,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:42,926 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-18 17:01:42,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:42,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088827600] [2019-12-18 17:01:42,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088827600] [2019-12-18 17:01:43,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:43,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:43,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921163652] [2019-12-18 17:01:43,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:43,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:43,074 INFO L87 Difference]: Start difference. First operand 20271 states and 61591 transitions. Second operand 9 states. [2019-12-18 17:01:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:44,346 INFO L93 Difference]: Finished difference Result 29033 states and 85853 transitions. [2019-12-18 17:01:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:01:44,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:01:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:44,387 INFO L225 Difference]: With dead ends: 29033 [2019-12-18 17:01:44,388 INFO L226 Difference]: Without dead ends: 29033 [2019-12-18 17:01:44,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:01:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29033 states. [2019-12-18 17:01:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29033 to 23020. [2019-12-18 17:01:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-18 17:01:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 69387 transitions. [2019-12-18 17:01:44,820 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 69387 transitions. Word has length 57 [2019-12-18 17:01:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:44,821 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 69387 transitions. [2019-12-18 17:01:44,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 69387 transitions. [2019-12-18 17:01:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:44,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:44,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:44,848 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-18 17:01:44,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:44,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256073362] [2019-12-18 17:01:44,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256073362] [2019-12-18 17:01:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524638154] [2019-12-18 17:01:44,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:44,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:44,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:44,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:44,981 INFO L87 Difference]: Start difference. First operand 23020 states and 69387 transitions. Second operand 9 states. [2019-12-18 17:01:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:46,240 INFO L93 Difference]: Finished difference Result 35444 states and 103738 transitions. [2019-12-18 17:01:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:01:46,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:01:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:46,289 INFO L225 Difference]: With dead ends: 35444 [2019-12-18 17:01:46,289 INFO L226 Difference]: Without dead ends: 35156 [2019-12-18 17:01:46,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:01:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35156 states. [2019-12-18 17:01:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35156 to 25598. [2019-12-18 17:01:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25598 states. [2019-12-18 17:01:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25598 states to 25598 states and 76158 transitions. [2019-12-18 17:01:46,994 INFO L78 Accepts]: Start accepts. Automaton has 25598 states and 76158 transitions. Word has length 57 [2019-12-18 17:01:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:46,994 INFO L462 AbstractCegarLoop]: Abstraction has 25598 states and 76158 transitions. [2019-12-18 17:01:46,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25598 states and 76158 transitions. [2019-12-18 17:01:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:47,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:47,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:47,025 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-18 17:01:47,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:47,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542917011] [2019-12-18 17:01:47,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:47,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542917011] [2019-12-18 17:01:47,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:47,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:01:47,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932530474] [2019-12-18 17:01:47,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:01:47,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:01:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:47,209 INFO L87 Difference]: Start difference. First operand 25598 states and 76158 transitions. Second operand 11 states. [2019-12-18 17:01:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:49,013 INFO L93 Difference]: Finished difference Result 42520 states and 124672 transitions. [2019-12-18 17:01:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:01:49,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-18 17:01:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:49,075 INFO L225 Difference]: With dead ends: 42520 [2019-12-18 17:01:49,075 INFO L226 Difference]: Without dead ends: 42331 [2019-12-18 17:01:49,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:01:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42331 states. [2019-12-18 17:01:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42331 to 26349. [2019-12-18 17:01:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26349 states. [2019-12-18 17:01:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26349 states to 26349 states and 78480 transitions. [2019-12-18 17:01:49,596 INFO L78 Accepts]: Start accepts. Automaton has 26349 states and 78480 transitions. Word has length 57 [2019-12-18 17:01:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:49,596 INFO L462 AbstractCegarLoop]: Abstraction has 26349 states and 78480 transitions. [2019-12-18 17:01:49,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:01:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 26349 states and 78480 transitions. [2019-12-18 17:01:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:49,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:49,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:49,630 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-18 17:01:49,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:49,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724103184] [2019-12-18 17:01:49,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:49,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724103184] [2019-12-18 17:01:49,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:49,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:01:49,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966765757] [2019-12-18 17:01:49,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:01:49,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:01:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:01:49,816 INFO L87 Difference]: Start difference. First operand 26349 states and 78480 transitions. Second operand 11 states. [2019-12-18 17:01:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:52,033 INFO L93 Difference]: Finished difference Result 38478 states and 112548 transitions. [2019-12-18 17:01:52,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:01:52,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-18 17:01:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:52,094 INFO L225 Difference]: With dead ends: 38478 [2019-12-18 17:01:52,095 INFO L226 Difference]: Without dead ends: 38298 [2019-12-18 17:01:52,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:01:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38298 states. [2019-12-18 17:01:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38298 to 26542. [2019-12-18 17:01:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26542 states. [2019-12-18 17:01:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26542 states to 26542 states and 79041 transitions. [2019-12-18 17:01:52,626 INFO L78 Accepts]: Start accepts. Automaton has 26542 states and 79041 transitions. Word has length 57 [2019-12-18 17:01:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:52,626 INFO L462 AbstractCegarLoop]: Abstraction has 26542 states and 79041 transitions. [2019-12-18 17:01:52,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:01:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 26542 states and 79041 transitions. [2019-12-18 17:01:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:52,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:52,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:52,656 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2075339129, now seen corresponding path program 11 times [2019-12-18 17:01:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954069074] [2019-12-18 17:01:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:52,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954069074] [2019-12-18 17:01:52,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:52,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:01:52,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728523361] [2019-12-18 17:01:52,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:01:52,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:01:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:01:52,749 INFO L87 Difference]: Start difference. First operand 26542 states and 79041 transitions. Second operand 7 states. [2019-12-18 17:01:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:53,769 INFO L93 Difference]: Finished difference Result 37998 states and 110590 transitions. [2019-12-18 17:01:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:01:53,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:01:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:53,823 INFO L225 Difference]: With dead ends: 37998 [2019-12-18 17:01:53,823 INFO L226 Difference]: Without dead ends: 37998 [2019-12-18 17:01:53,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:01:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37998 states. [2019-12-18 17:01:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37998 to 25512. [2019-12-18 17:01:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25512 states. [2019-12-18 17:01:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25512 states to 25512 states and 76077 transitions. [2019-12-18 17:01:54,603 INFO L78 Accepts]: Start accepts. Automaton has 25512 states and 76077 transitions. Word has length 57 [2019-12-18 17:01:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:54,603 INFO L462 AbstractCegarLoop]: Abstraction has 25512 states and 76077 transitions. [2019-12-18 17:01:54,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:01:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25512 states and 76077 transitions. [2019-12-18 17:01:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:54,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:54,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:54,629 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 817096895, now seen corresponding path program 12 times [2019-12-18 17:01:54,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:54,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865684821] [2019-12-18 17:01:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:54,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865684821] [2019-12-18 17:01:54,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:54,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:54,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121037729] [2019-12-18 17:01:54,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:54,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:54,764 INFO L87 Difference]: Start difference. First operand 25512 states and 76077 transitions. Second operand 9 states. [2019-12-18 17:01:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:56,377 INFO L93 Difference]: Finished difference Result 37866 states and 110188 transitions. [2019-12-18 17:01:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 17:01:56,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:01:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:56,430 INFO L225 Difference]: With dead ends: 37866 [2019-12-18 17:01:56,430 INFO L226 Difference]: Without dead ends: 37866 [2019-12-18 17:01:56,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:01:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37866 states. [2019-12-18 17:01:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37866 to 22807. [2019-12-18 17:01:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22807 states. [2019-12-18 17:01:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22807 states to 22807 states and 68128 transitions. [2019-12-18 17:01:56,883 INFO L78 Accepts]: Start accepts. Automaton has 22807 states and 68128 transitions. Word has length 57 [2019-12-18 17:01:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:56,884 INFO L462 AbstractCegarLoop]: Abstraction has 22807 states and 68128 transitions. [2019-12-18 17:01:56,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22807 states and 68128 transitions. [2019-12-18 17:01:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:56,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:56,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:56,920 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1385383185, now seen corresponding path program 13 times [2019-12-18 17:01:56,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:56,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218839418] [2019-12-18 17:01:56,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:57,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218839418] [2019-12-18 17:01:57,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:57,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:01:57,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175993622] [2019-12-18 17:01:57,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:01:57,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:01:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:01:57,051 INFO L87 Difference]: Start difference. First operand 22807 states and 68128 transitions. Second operand 9 states. [2019-12-18 17:01:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:58,292 INFO L93 Difference]: Finished difference Result 41961 states and 124276 transitions. [2019-12-18 17:01:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:01:58,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:01:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:58,353 INFO L225 Difference]: With dead ends: 41961 [2019-12-18 17:01:58,353 INFO L226 Difference]: Without dead ends: 41849 [2019-12-18 17:01:58,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:01:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41849 states. [2019-12-18 17:01:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41849 to 24907. [2019-12-18 17:01:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24907 states. [2019-12-18 17:01:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24907 states to 24907 states and 74515 transitions. [2019-12-18 17:01:59,059 INFO L78 Accepts]: Start accepts. Automaton has 24907 states and 74515 transitions. Word has length 57 [2019-12-18 17:01:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:59,059 INFO L462 AbstractCegarLoop]: Abstraction has 24907 states and 74515 transitions. [2019-12-18 17:01:59,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:01:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24907 states and 74515 transitions. [2019-12-18 17:01:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:01:59,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:59,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:59,091 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 226977995, now seen corresponding path program 14 times [2019-12-18 17:01:59,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:59,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945504703] [2019-12-18 17:01:59,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:59,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945504703] [2019-12-18 17:01:59,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:59,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:59,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750118978] [2019-12-18 17:01:59,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:59,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:59,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:59,144 INFO L87 Difference]: Start difference. First operand 24907 states and 74515 transitions. Second operand 3 states. [2019-12-18 17:01:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:59,244 INFO L93 Difference]: Finished difference Result 24907 states and 74513 transitions. [2019-12-18 17:01:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:59,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:01:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:59,283 INFO L225 Difference]: With dead ends: 24907 [2019-12-18 17:01:59,284 INFO L226 Difference]: Without dead ends: 24907 [2019-12-18 17:01:59,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24907 states. [2019-12-18 17:01:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24907 to 20096. [2019-12-18 17:01:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20096 states. [2019-12-18 17:01:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20096 states to 20096 states and 61226 transitions. [2019-12-18 17:01:59,641 INFO L78 Accepts]: Start accepts. Automaton has 20096 states and 61226 transitions. Word has length 57 [2019-12-18 17:01:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:01:59,641 INFO L462 AbstractCegarLoop]: Abstraction has 20096 states and 61226 transitions. [2019-12-18 17:01:59,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:01:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20096 states and 61226 transitions. [2019-12-18 17:01:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:01:59,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:01:59,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:01:59,663 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:01:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:01:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1231350538, now seen corresponding path program 1 times [2019-12-18 17:01:59,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:01:59,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072172086] [2019-12-18 17:01:59,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:01:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:01:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:01:59,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072172086] [2019-12-18 17:01:59,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:01:59,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:01:59,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451556838] [2019-12-18 17:01:59,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:01:59,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:01:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:01:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:59,720 INFO L87 Difference]: Start difference. First operand 20096 states and 61226 transitions. Second operand 3 states. [2019-12-18 17:01:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:01:59,805 INFO L93 Difference]: Finished difference Result 15898 states and 47680 transitions. [2019-12-18 17:01:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:01:59,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:01:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:01:59,841 INFO L225 Difference]: With dead ends: 15898 [2019-12-18 17:01:59,841 INFO L226 Difference]: Without dead ends: 15898 [2019-12-18 17:01:59,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:01:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15898 states. [2019-12-18 17:02:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15898 to 15233. [2019-12-18 17:02:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15233 states. [2019-12-18 17:02:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15233 states to 15233 states and 45683 transitions. [2019-12-18 17:02:00,271 INFO L78 Accepts]: Start accepts. Automaton has 15233 states and 45683 transitions. Word has length 58 [2019-12-18 17:02:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:00,272 INFO L462 AbstractCegarLoop]: Abstraction has 15233 states and 45683 transitions. [2019-12-18 17:02:00,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15233 states and 45683 transitions. [2019-12-18 17:02:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:02:00,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:00,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:00,295 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-18 17:02:00,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:00,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182414277] [2019-12-18 17:02:00,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:02:00,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:02:00,433 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:02:00,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t733~0.base_21|) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21|)) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21|) |v_ULTIMATE.start_main_~#t733~0.offset_16| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 |v_ULTIMATE.start_main_~#t733~0.offset_16|) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t733~0.base_21| 4)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, ULTIMATE.start_main_~#t733~0.base=|v_ULTIMATE.start_main_~#t733~0.base_21|, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ULTIMATE.start_main_~#t733~0.offset=|v_ULTIMATE.start_main_~#t733~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t736~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t736~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t735~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t735~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t734~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t733~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t733~0.offset, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:02:00,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t734~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t734~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10|) |v_ULTIMATE.start_main_~#t734~0.offset_10| 1)) |v_#memory_int_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t734~0.base_10| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t734~0.base_10| 4)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_~#t734~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:02:00,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t735~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t735~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11|) |v_ULTIMATE.start_main_~#t735~0.offset_10| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t735~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t735~0.base_11| 4)) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t735~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t735~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:02:00,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:02:00,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t736~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t736~0.offset_10|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t736~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t736~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11|) |v_ULTIMATE.start_main_~#t736~0.offset_10| 3)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t736~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t736~0.offset] because there is no mapped edge [2019-12-18 17:02:00,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out1332921077| |P3Thread1of1ForFork0_#t~ite33_Out1332921077|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In1332921077 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1332921077 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out1332921077| ~y$w_buff1~0_In1332921077) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1332921077| ~y~0_In1332921077)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1332921077, ~y$w_buff1~0=~y$w_buff1~0_In1332921077, ~y~0=~y~0_In1332921077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332921077} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1332921077, ~y$w_buff1~0=~y$w_buff1~0_In1332921077, ~y~0=~y~0_In1332921077, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1332921077|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1332921077|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332921077} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 17:02:00,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:02:00,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In253780549 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In253780549 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out253780549|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In253780549 |P3Thread1of1ForFork0_#t~ite34_Out253780549|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In253780549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In253780549} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In253780549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In253780549, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out253780549|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 17:02:00,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1899506733 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1899506733 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1899506733 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-1899506733 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1899506733| ~y$w_buff1_used~0_In-1899506733) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1899506733| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1899506733, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1899506733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899506733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899506733} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1899506733, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1899506733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1899506733, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1899506733|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1899506733} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 17:02:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-37146944 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-37146944 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-37146944| 0) (not .cse1)) (and (= ~y$r_buff0_thd4~0_In-37146944 |P3Thread1of1ForFork0_#t~ite36_Out-37146944|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-37146944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-37146944} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-37146944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-37146944, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-37146944|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 17:02:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1288313046 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-1288313046 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1288313046 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-1288313046 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-1288313046| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1288313046| ~y$r_buff1_thd4~0_In-1288313046)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1288313046, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1288313046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288313046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1288313046} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1288313046, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1288313046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288313046, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1288313046|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1288313046} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 17:02:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:02:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-249492530 256)))) (or (and (= ~y$w_buff1~0_In-249492530 |P1Thread1of1ForFork2_#t~ite12_Out-249492530|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In-249492530| |P1Thread1of1ForFork2_#t~ite11_Out-249492530|)) (and (= ~y$w_buff1~0_In-249492530 |P1Thread1of1ForFork2_#t~ite11_Out-249492530|) (= |P1Thread1of1ForFork2_#t~ite11_Out-249492530| |P1Thread1of1ForFork2_#t~ite12_Out-249492530|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-249492530 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-249492530 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-249492530 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-249492530 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-249492530, ~y$w_buff1~0=~y$w_buff1~0_In-249492530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-249492530, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-249492530, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-249492530|, ~weak$$choice2~0=~weak$$choice2~0_In-249492530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-249492530} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-249492530, ~y$w_buff1~0=~y$w_buff1~0_In-249492530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-249492530, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-249492530, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-249492530|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-249492530|, ~weak$$choice2~0=~weak$$choice2~0_In-249492530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-249492530} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:02:00,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1983614243 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In1983614243| |P1Thread1of1ForFork2_#t~ite14_Out1983614243|) (= |P1Thread1of1ForFork2_#t~ite15_Out1983614243| ~y$w_buff0_used~0_In1983614243) (not .cse0)) (and (= ~y$w_buff0_used~0_In1983614243 |P1Thread1of1ForFork2_#t~ite14_Out1983614243|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1983614243 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1983614243 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1983614243 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In1983614243 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork2_#t~ite15_Out1983614243| |P1Thread1of1ForFork2_#t~ite14_Out1983614243|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1983614243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1983614243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1983614243, ~weak$$choice2~0=~weak$$choice2~0_In1983614243, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1983614243|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983614243} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1983614243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1983614243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1983614243, ~weak$$choice2~0=~weak$$choice2~0_In1983614243, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1983614243|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1983614243|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983614243} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 17:02:00,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:02:00,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-520335020 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-520335020| ~y$r_buff1_thd2~0_In-520335020) (= |P1Thread1of1ForFork2_#t~ite23_In-520335020| |P1Thread1of1ForFork2_#t~ite23_Out-520335020|)) (and (= |P1Thread1of1ForFork2_#t~ite23_Out-520335020| |P1Thread1of1ForFork2_#t~ite24_Out-520335020|) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-520335020| ~y$r_buff1_thd2~0_In-520335020) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-520335020 256)))) (or (= (mod ~y$w_buff0_used~0_In-520335020 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-520335020 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-520335020 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-520335020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-520335020, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-520335020|, ~weak$$choice2~0=~weak$$choice2~0_In-520335020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520335020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-520335020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-520335020, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-520335020|, ~weak$$choice2~0=~weak$$choice2~0_In-520335020, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-520335020|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520335020} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:02:00,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 17:02:00,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In282589942 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In282589942 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out282589942| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In282589942 |P2Thread1of1ForFork3_#t~ite28_Out282589942|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282589942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282589942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282589942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282589942, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out282589942|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 17:02:00,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In470148948 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In470148948 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In470148948 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In470148948 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out470148948| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite29_Out470148948| ~y$w_buff1_used~0_In470148948)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In470148948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In470148948, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In470148948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In470148948} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In470148948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In470148948, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In470148948, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out470148948|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In470148948} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 17:02:00,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In692609117 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In692609117 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In692609117 ~y$r_buff0_thd3~0_Out692609117)) (and (= ~y$r_buff0_thd3~0_Out692609117 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In692609117, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In692609117} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out692609117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In692609117, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out692609117} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:02:00,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1883283061 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1883283061 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1883283061 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1883283061 256)))) (or (and (= ~y$r_buff1_thd3~0_In1883283061 |P2Thread1of1ForFork3_#t~ite31_Out1883283061|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out1883283061|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1883283061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1883283061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1883283061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1883283061} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1883283061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1883283061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1883283061, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1883283061|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1883283061} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 17:02:00,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:02:00,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:02:00,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1574989133 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1574989133 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out1574989133| |ULTIMATE.start_main_#t~ite43_Out1574989133|))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1574989133| ~y~0_In1574989133) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1574989133| ~y$w_buff1~0_In1574989133) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1574989133, ~y~0=~y~0_In1574989133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1574989133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1574989133} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1574989133, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1574989133|, ~y~0=~y~0_In1574989133, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1574989133|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1574989133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1574989133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:02:00,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1642014445 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1642014445 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1642014445| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1642014445| ~y$w_buff0_used~0_In-1642014445) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642014445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1642014445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642014445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1642014445, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1642014445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:02:00,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In399809451 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In399809451 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In399809451 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In399809451 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out399809451| ~y$w_buff1_used~0_In399809451)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out399809451| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In399809451, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In399809451, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In399809451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In399809451} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In399809451, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In399809451, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In399809451, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out399809451|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In399809451} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:02:00,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-194357798 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-194357798 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-194357798 |ULTIMATE.start_main_#t~ite46_Out-194357798|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-194357798| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-194357798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-194357798} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-194357798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-194357798, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-194357798|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:02:00,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In972481706 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In972481706 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In972481706 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In972481706 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In972481706 |ULTIMATE.start_main_#t~ite47_Out972481706|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite47_Out972481706| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In972481706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In972481706, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In972481706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In972481706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In972481706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In972481706, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out972481706|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In972481706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In972481706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 17:02:00,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:02:00,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:02:00 BasicIcfg [2019-12-18 17:02:00,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:02:00,562 INFO L168 Benchmark]: Toolchain (without parser) took 158397.74 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,563 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 980.79 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 100.7 MB in the beginning and 159.1 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 155.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,565 INFO L168 Benchmark]: Boogie Preprocessor took 61.76 ms. Allocated memory is still 205.5 MB. Free memory was 155.9 MB in the beginning and 154.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,565 INFO L168 Benchmark]: RCFGBuilder took 834.67 ms. Allocated memory is still 205.5 MB. Free memory was 154.0 MB in the beginning and 104.6 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,566 INFO L168 Benchmark]: TraceAbstraction took 156446.21 ms. Allocated memory was 205.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 104.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 17:02:00,569 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.49 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 980.79 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 100.7 MB in the beginning and 159.1 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 155.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.76 ms. Allocated memory is still 205.5 MB. Free memory was 155.9 MB in the beginning and 154.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.67 ms. Allocated memory is still 205.5 MB. Free memory was 154.0 MB in the beginning and 104.6 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 156446.21 ms. Allocated memory was 205.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 104.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t733, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t734, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t735, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t736, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 48.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5777 SDtfs, 6789 SDslu, 16294 SDs, 0 SdLazy, 11529 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 74 SyntacticMatches, 27 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 230330 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1214 ConstructedInterpolants, 0 QuantifiedInterpolants, 250872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...