/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:46:21,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:46:21,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:46:21,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:46:21,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:46:21,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:46:21,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:46:21,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:46:21,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:46:21,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:46:21,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:46:21,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:46:21,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:46:21,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:46:21,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:46:21,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:46:21,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:46:21,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:46:21,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:46:21,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:46:21,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:46:21,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:46:21,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:46:21,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:46:21,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:46:21,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:46:21,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:46:21,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:46:21,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:46:21,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:46:21,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:46:21,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:46:21,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:46:21,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:46:21,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:46:21,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:46:21,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:46:21,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:46:21,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:46:21,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:46:21,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:46:21,946 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-NoLbe-MCR.epf [2019-12-27 23:46:21,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:46:21,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:46:21,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:46:21,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:46:21,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:46:21,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:46:21,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:46:21,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:46:21,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:46:21,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:46:21,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:46:21,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:46:21,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:46:21,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:46:21,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:46:21,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:46:21,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:46:21,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:46:21,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:46:21,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:46:21,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:46:21,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:46:21,974 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:46:21,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:46:21,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:46:21,976 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:46:21,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:46:22,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:46:22,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:46:22,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:46:22,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:46:22,256 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:46:22,257 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 23:46:22,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454846dd/6f557326e31e4a5a865aac289a57c4bf/FLAG20575afd2 [2019-12-27 23:46:22,852 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:46:22,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 23:46:22,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454846dd/6f557326e31e4a5a865aac289a57c4bf/FLAG20575afd2 [2019-12-27 23:46:23,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454846dd/6f557326e31e4a5a865aac289a57c4bf [2019-12-27 23:46:23,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:46:23,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:46:23,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:46:23,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:46:23,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:46:23,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:23,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677b895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23, skipping insertion in model container [2019-12-27 23:46:23,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:23,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:46:23,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:46:23,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:46:23,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:46:23,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:46:23,996 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:46:23,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23 WrapperNode [2019-12-27 23:46:23,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:46:23,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:46:23,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:46:23,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:46:24,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:46:24,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:46:24,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:46:24,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:46:24,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (1/1) ... [2019-12-27 23:46:24,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:46:24,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:46:24,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:46:24,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:46:24,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46: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-27 23:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:46:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:46:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:46:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:46:24,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:46:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:46:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:46:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:46:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:46:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:46:24,210 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:46:25,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:46:25,235 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:46:25,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:25 BoogieIcfgContainer [2019-12-27 23:46:25,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:46:25,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:46:25,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:46:25,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:46:25,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:46:23" (1/3) ... [2019-12-27 23:46:25,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca16f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:25, skipping insertion in model container [2019-12-27 23:46:25,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:23" (2/3) ... [2019-12-27 23:46:25,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca16f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:25, skipping insertion in model container [2019-12-27 23:46:25,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:25" (3/3) ... [2019-12-27 23:46:25,246 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc.i [2019-12-27 23:46:25,256 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:46:25,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:46:25,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:46:25,265 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:46:25,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,395 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:46:25,420 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:46:25,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:46:25,442 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:46:25,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:46:25,442 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:46:25,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:46:25,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:46:25,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:46:25,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:46:25,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-27 23:46:37,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-27 23:46:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-27 23:46:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:46:37,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:46:37,714 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] [2019-12-27 23:46:37,715 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:46:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:46:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1867003899, now seen corresponding path program 1 times [2019-12-27 23:46:37,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:46:37,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767825101] [2019-12-27 23:46:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:46:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:46:38,050 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-27 23:46:38,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767825101] [2019-12-27 23:46:38,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:46:38,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:46:38,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266835183] [2019-12-27 23:46:38,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:46:38,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:46:38,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-27 23:46:38,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:46:38,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:46:38,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:46:38,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:46:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:46:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:46:38,101 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-27 23:46:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:46:39,607 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-27 23:46:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:46:39,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 23:46:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:46:40,101 INFO L225 Difference]: With dead ends: 101969 [2019-12-27 23:46:40,101 INFO L226 Difference]: Without dead ends: 74593 [2019-12-27 23:46:40,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:46:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-27 23:46:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-27 23:46:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-27 23:46:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-27 23:46:49,761 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-27 23:46:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:46:49,764 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-27 23:46:49,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:46:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-27 23:46:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:46:49,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:46:49,787 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] [2019-12-27 23:46:49,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:46:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:46:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1051219315, now seen corresponding path program 1 times [2019-12-27 23:46:49,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:46:49,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517459169] [2019-12-27 23:46:49,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:46:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:46:49,926 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-27 23:46:49,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517459169] [2019-12-27 23:46:49,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:46:49,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:46:49,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028326184] [2019-12-27 23:46:49,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:46:49,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:46:49,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 23:46:49,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:46:49,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:46:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:46:49,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:46:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:46:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:46:49,945 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-27 23:46:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:46:51,625 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-27 23:46:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:46:51,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 23:46:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:46:52,780 INFO L225 Difference]: With dead ends: 121639 [2019-12-27 23:46:52,780 INFO L226 Difference]: Without dead ends: 121103 [2019-12-27 23:46:52,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:46:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-27 23:46:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-27 23:46:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-27 23:46:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-27 23:46:59,676 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-27 23:46:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:46:59,678 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-27 23:46:59,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:46:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-27 23:46:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 23:46:59,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:46:59,687 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] [2019-12-27 23:46:59,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:46:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:46:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1611122121, now seen corresponding path program 1 times [2019-12-27 23:46:59,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:46:59,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640646973] [2019-12-27 23:46:59,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:46:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:46:59,786 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-27 23:46:59,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640646973] [2019-12-27 23:46:59,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:46:59,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:46:59,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471622889] [2019-12-27 23:46:59,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:46:59,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:46:59,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-27 23:46:59,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:46:59,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:46:59,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:46:59,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:46:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:46:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:46:59,799 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-27 23:47:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:47:04,353 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-27 23:47:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:47:04,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 23:47:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:47:04,713 INFO L225 Difference]: With dead ends: 149065 [2019-12-27 23:47:04,714 INFO L226 Difference]: Without dead ends: 148561 [2019-12-27 23:47:04,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:47:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-27 23:47:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-27 23:47:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-27 23:47:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-27 23:47:10,204 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-27 23:47:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:47:10,205 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-27 23:47:10,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:47:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-27 23:47:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 23:47:10,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:47:10,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:47:10,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:47:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:47:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1163539633, now seen corresponding path program 1 times [2019-12-27 23:47:10,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:47:10,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642377545] [2019-12-27 23:47:10,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:47:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:47:10,276 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-27 23:47:10,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642377545] [2019-12-27 23:47:10,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:47:10,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:47:10,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399590069] [2019-12-27 23:47:10,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:47:10,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:47:10,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-27 23:47:10,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:47:10,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:47:10,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:47:10,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:47:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:47:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:47:10,291 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-27 23:47:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:47:15,890 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-27 23:47:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:47:15,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 23:47:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:47:16,470 INFO L225 Difference]: With dead ends: 226103 [2019-12-27 23:47:16,470 INFO L226 Difference]: Without dead ends: 226103 [2019-12-27 23:47:16,471 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-27 23:47:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-27 23:47:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-27 23:47:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-27 23:47:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-27 23:47:24,042 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-27 23:47:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:47:24,042 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-27 23:47:24,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:47:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-27 23:47:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:47:24,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:47:24,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:47:24,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:47:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:47:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1032930122, now seen corresponding path program 1 times [2019-12-27 23:47:24,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:47:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021888601] [2019-12-27 23:47:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:47:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:47:24,264 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-27 23:47:24,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021888601] [2019-12-27 23:47:24,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:47:24,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:47:24,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778947171] [2019-12-27 23:47:24,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:47:24,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:47:24,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-27 23:47:24,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:47:29,188 WARN L192 SmtUtils]: Spent 4.85 s on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 23:47:29,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:47:29,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:47:29,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:47:29,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:47:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:47:29,194 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 7 states. [2019-12-27 23:47:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:47:31,570 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-27 23:47:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:47:31,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 23:47:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:47:33,159 INFO L225 Difference]: With dead ends: 257719 [2019-12-27 23:47:33,159 INFO L226 Difference]: Without dead ends: 257719 [2019-12-27 23:47:33,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:47:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-27 23:47:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-27 23:47:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-27 23:47:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-27 23:47:46,962 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-27 23:47:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:47:46,963 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-27 23:47:46,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:47:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-27 23:47:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:47:47,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:47:47,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:47:47,024 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:47:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:47:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1465085815, now seen corresponding path program 1 times [2019-12-27 23:47:47,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:47:47,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339492605] [2019-12-27 23:47:47,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:47:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:47:47,161 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-27 23:47:47,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339492605] [2019-12-27 23:47:47,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:47:47,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:47:47,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899669472] [2019-12-27 23:47:47,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:47:47,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:47:47,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-27 23:47:47,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:47:47,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:47:47,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:47:47,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:47:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:47:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:47:47,204 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 8 states. [2019-12-27 23:47:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:47:57,204 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-27 23:47:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:47:57,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 23:47:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:47:58,194 INFO L225 Difference]: With dead ends: 334522 [2019-12-27 23:47:58,194 INFO L226 Difference]: Without dead ends: 334522 [2019-12-27 23:47:58,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:48:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-27 23:48:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-27 23:48:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-27 23:48:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-27 23:48:07,884 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-27 23:48:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:07,884 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-27 23:48:07,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:48:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-27 23:48:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:48:07,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:07,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:48:07,906 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1942377800, now seen corresponding path program 1 times [2019-12-27 23:48:07,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:07,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048827916] [2019-12-27 23:48:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:07,990 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-27 23:48:07,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048827916] [2019-12-27 23:48:07,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:07,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:48:07,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [647498461] [2019-12-27 23:48:07,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:07,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:08,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-27 23:48:08,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:08,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:08,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:48:08,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:48:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:48:08,006 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 3 states. [2019-12-27 23:48:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:15,711 INFO L93 Difference]: Finished difference Result 221337 states and 797613 transitions. [2019-12-27 23:48:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:48:15,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 23:48:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:16,298 INFO L225 Difference]: With dead ends: 221337 [2019-12-27 23:48:16,298 INFO L226 Difference]: Without dead ends: 221337 [2019-12-27 23:48:16,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:48:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221337 states. [2019-12-27 23:48:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221337 to 219442. [2019-12-27 23:48:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219442 states. [2019-12-27 23:48:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219442 states to 219442 states and 791653 transitions. [2019-12-27 23:48:23,521 INFO L78 Accepts]: Start accepts. Automaton has 219442 states and 791653 transitions. Word has length 55 [2019-12-27 23:48:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:23,522 INFO L462 AbstractCegarLoop]: Abstraction has 219442 states and 791653 transitions. [2019-12-27 23:48:23,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:48:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 219442 states and 791653 transitions. [2019-12-27 23:48:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:48:23,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:23,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:48:23,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -125662630, now seen corresponding path program 1 times [2019-12-27 23:48:23,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:23,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011577652] [2019-12-27 23:48:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:23,655 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-27 23:48:23,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011577652] [2019-12-27 23:48:23,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:23,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:48:23,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884417473] [2019-12-27 23:48:23,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:23,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:23,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-27 23:48:23,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:23,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:48:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:48:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:48:23,673 INFO L87 Difference]: Start difference. First operand 219442 states and 791653 transitions. Second operand 6 states. [2019-12-27 23:48:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:31,488 INFO L93 Difference]: Finished difference Result 293610 states and 1039511 transitions. [2019-12-27 23:48:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:48:31,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 23:48:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:32,237 INFO L225 Difference]: With dead ends: 293610 [2019-12-27 23:48:32,237 INFO L226 Difference]: Without dead ends: 293042 [2019-12-27 23:48:32,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:48:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293042 states. [2019-12-27 23:48:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293042 to 219895. [2019-12-27 23:48:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219895 states. [2019-12-27 23:48:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219895 states to 219895 states and 793471 transitions. [2019-12-27 23:48:40,389 INFO L78 Accepts]: Start accepts. Automaton has 219895 states and 793471 transitions. Word has length 55 [2019-12-27 23:48:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:40,390 INFO L462 AbstractCegarLoop]: Abstraction has 219895 states and 793471 transitions. [2019-12-27 23:48:40,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:48:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 219895 states and 793471 transitions. [2019-12-27 23:48:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 23:48:40,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:40,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:48:40,408 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2123073383, now seen corresponding path program 1 times [2019-12-27 23:48:40,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:40,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797182205] [2019-12-27 23:48:40,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:41,590 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-27 23:48:41,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797182205] [2019-12-27 23:48:41,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:41,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:48:41,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627067421] [2019-12-27 23:48:41,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:41,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:41,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-27 23:48:41,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:41,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:41,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:48:41,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:48:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:48:41,612 INFO L87 Difference]: Start difference. First operand 219895 states and 793471 transitions. Second operand 6 states. [2019-12-27 23:48:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:43,494 INFO L93 Difference]: Finished difference Result 269563 states and 953906 transitions. [2019-12-27 23:48:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:48:43,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 23:48:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:51,279 INFO L225 Difference]: With dead ends: 269563 [2019-12-27 23:48:51,279 INFO L226 Difference]: Without dead ends: 269563 [2019-12-27 23:48:51,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:48:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269563 states. [2019-12-27 23:48:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269563 to 239711. [2019-12-27 23:48:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239711 states. [2019-12-27 23:48:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239711 states to 239711 states and 857782 transitions. [2019-12-27 23:48:58,971 INFO L78 Accepts]: Start accepts. Automaton has 239711 states and 857782 transitions. Word has length 56 [2019-12-27 23:48:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:58,971 INFO L462 AbstractCegarLoop]: Abstraction has 239711 states and 857782 transitions. [2019-12-27 23:48:58,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:48:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 239711 states and 857782 transitions. [2019-12-27 23:48:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 23:48:58,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:58,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:48:58,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1284390232, now seen corresponding path program 1 times [2019-12-27 23:48:58,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:58,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374525369] [2019-12-27 23:48:58,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:59,081 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-27 23:48:59,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374525369] [2019-12-27 23:48:59,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:59,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:48:59,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052339928] [2019-12-27 23:48:59,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:59,088 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:59,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-27 23:48:59,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:59,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:59,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:48:59,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:48:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:48:59,096 INFO L87 Difference]: Start difference. First operand 239711 states and 857782 transitions. Second operand 4 states. [2019-12-27 23:48:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:59,236 INFO L93 Difference]: Finished difference Result 28167 states and 88386 transitions. [2019-12-27 23:48:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 23:48:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:59,269 INFO L225 Difference]: With dead ends: 28167 [2019-12-27 23:48:59,269 INFO L226 Difference]: Without dead ends: 20525 [2019-12-27 23:48:59,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:48:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20525 states. [2019-12-27 23:48:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20525 to 20278. [2019-12-27 23:48:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20278 states. [2019-12-27 23:48:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20278 states to 20278 states and 60346 transitions. [2019-12-27 23:48:59,528 INFO L78 Accepts]: Start accepts. Automaton has 20278 states and 60346 transitions. Word has length 56 [2019-12-27 23:48:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:59,529 INFO L462 AbstractCegarLoop]: Abstraction has 20278 states and 60346 transitions. [2019-12-27 23:48:59,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:48:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20278 states and 60346 transitions. [2019-12-27 23:48:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 23:48:59,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:59,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:48:59,535 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1986032310, now seen corresponding path program 1 times [2019-12-27 23:48:59,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:59,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155736092] [2019-12-27 23:48:59,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:48:59,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155736092] [2019-12-27 23:48:59,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:59,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:48:59,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393997996] [2019-12-27 23:48:59,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:59,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:59,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-27 23:48:59,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:59,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:59,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:48:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:48:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:48:59,597 INFO L87 Difference]: Start difference. First operand 20278 states and 60346 transitions. Second operand 4 states. [2019-12-27 23:48:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:59,858 INFO L93 Difference]: Finished difference Result 23855 states and 70819 transitions. [2019-12-27 23:48:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:48:59,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 23:48:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:59,891 INFO L225 Difference]: With dead ends: 23855 [2019-12-27 23:48:59,891 INFO L226 Difference]: Without dead ends: 23855 [2019-12-27 23:48:59,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:48:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23855 states. [2019-12-27 23:49:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23855 to 23171. [2019-12-27 23:49:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23171 states. [2019-12-27 23:49:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23171 states to 23171 states and 68857 transitions. [2019-12-27 23:49:02,268 INFO L78 Accepts]: Start accepts. Automaton has 23171 states and 68857 transitions. Word has length 63 [2019-12-27 23:49:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:02,269 INFO L462 AbstractCegarLoop]: Abstraction has 23171 states and 68857 transitions. [2019-12-27 23:49:02,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:49:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 23171 states and 68857 transitions. [2019-12-27 23:49:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 23:49:02,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:02,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:02,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash -566124651, now seen corresponding path program 1 times [2019-12-27 23:49:02,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:02,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34908862] [2019-12-27 23:49:02,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:02,343 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-27 23:49:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34908862] [2019-12-27 23:49:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:49:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689014868] [2019-12-27 23:49:02,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:02,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:02,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-27 23:49:02,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:02,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:02,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:49:02,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:49:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:02,366 INFO L87 Difference]: Start difference. First operand 23171 states and 68857 transitions. Second operand 6 states. [2019-12-27 23:49:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:03,062 INFO L93 Difference]: Finished difference Result 30460 states and 88591 transitions. [2019-12-27 23:49:03,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:49:03,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-27 23:49:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:03,103 INFO L225 Difference]: With dead ends: 30460 [2019-12-27 23:49:03,103 INFO L226 Difference]: Without dead ends: 30399 [2019-12-27 23:49:03,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:49:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30399 states. [2019-12-27 23:49:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30399 to 29189. [2019-12-27 23:49:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29189 states. [2019-12-27 23:49:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29189 states to 29189 states and 85143 transitions. [2019-12-27 23:49:03,478 INFO L78 Accepts]: Start accepts. Automaton has 29189 states and 85143 transitions. Word has length 63 [2019-12-27 23:49:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:03,478 INFO L462 AbstractCegarLoop]: Abstraction has 29189 states and 85143 transitions. [2019-12-27 23:49:03,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:49:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29189 states and 85143 transitions. [2019-12-27 23:49:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 23:49:03,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:03,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:03,485 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -69430682, now seen corresponding path program 1 times [2019-12-27 23:49:03,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:03,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999906599] [2019-12-27 23:49:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:03,528 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-27 23:49:03,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999906599] [2019-12-27 23:49:03,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:03,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:49:03,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315991909] [2019-12-27 23:49:03,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:03,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:03,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-27 23:49:03,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:03,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:03,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:49:03,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:49:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:49:03,557 INFO L87 Difference]: Start difference. First operand 29189 states and 85143 transitions. Second operand 3 states. [2019-12-27 23:49:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:03,747 INFO L93 Difference]: Finished difference Result 35456 states and 102026 transitions. [2019-12-27 23:49:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:49:03,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 23:49:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:03,794 INFO L225 Difference]: With dead ends: 35456 [2019-12-27 23:49:03,794 INFO L226 Difference]: Without dead ends: 35456 [2019-12-27 23:49:03,795 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-27 23:49:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35456 states. [2019-12-27 23:49:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35456 to 29545. [2019-12-27 23:49:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29545 states. [2019-12-27 23:49:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29545 states to 29545 states and 84266 transitions. [2019-12-27 23:49:04,448 INFO L78 Accepts]: Start accepts. Automaton has 29545 states and 84266 transitions. Word has length 69 [2019-12-27 23:49:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:04,448 INFO L462 AbstractCegarLoop]: Abstraction has 29545 states and 84266 transitions. [2019-12-27 23:49:04,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:49:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 29545 states and 84266 transitions. [2019-12-27 23:49:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 23:49:04,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:04,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:04,459 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1005746969, now seen corresponding path program 1 times [2019-12-27 23:49:04,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:04,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720078112] [2019-12-27 23:49:04,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:04,521 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-27 23:49:04,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720078112] [2019-12-27 23:49:04,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:49:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590830169] [2019-12-27 23:49:04,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:04,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:04,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-27 23:49:04,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:04,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:04,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:49:04,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:49:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:49:04,558 INFO L87 Difference]: Start difference. First operand 29545 states and 84266 transitions. Second operand 5 states. [2019-12-27 23:49:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:04,996 INFO L93 Difference]: Finished difference Result 33498 states and 95399 transitions. [2019-12-27 23:49:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:49:04,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-27 23:49:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:05,041 INFO L225 Difference]: With dead ends: 33498 [2019-12-27 23:49:05,041 INFO L226 Difference]: Without dead ends: 33498 [2019-12-27 23:49:05,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:49:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33498 states. [2019-12-27 23:49:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33498 to 29866. [2019-12-27 23:49:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29866 states. [2019-12-27 23:49:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29866 states to 29866 states and 85107 transitions. [2019-12-27 23:49:05,426 INFO L78 Accepts]: Start accepts. Automaton has 29866 states and 85107 transitions. Word has length 75 [2019-12-27 23:49:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:05,426 INFO L462 AbstractCegarLoop]: Abstraction has 29866 states and 85107 transitions. [2019-12-27 23:49:05,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:49:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29866 states and 85107 transitions. [2019-12-27 23:49:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 23:49:05,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:05,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:05,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1546409992, now seen corresponding path program 1 times [2019-12-27 23:49:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:05,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159925326] [2019-12-27 23:49:05,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:05,524 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-27 23:49:05,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159925326] [2019-12-27 23:49:05,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:05,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:05,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698593759] [2019-12-27 23:49:05,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:05,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:05,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-27 23:49:05,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:05,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:05,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:49:05,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:49:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:49:05,775 INFO L87 Difference]: Start difference. First operand 29866 states and 85107 transitions. Second operand 7 states. [2019-12-27 23:49:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:06,783 INFO L93 Difference]: Finished difference Result 33106 states and 94046 transitions. [2019-12-27 23:49:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:49:06,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-27 23:49:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:06,849 INFO L225 Difference]: With dead ends: 33106 [2019-12-27 23:49:06,849 INFO L226 Difference]: Without dead ends: 33029 [2019-12-27 23:49:06,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:49:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33029 states. [2019-12-27 23:49:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33029 to 26625. [2019-12-27 23:49:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26625 states. [2019-12-27 23:49:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26625 states to 26625 states and 76895 transitions. [2019-12-27 23:49:07,227 INFO L78 Accepts]: Start accepts. Automaton has 26625 states and 76895 transitions. Word has length 75 [2019-12-27 23:49:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:07,227 INFO L462 AbstractCegarLoop]: Abstraction has 26625 states and 76895 transitions. [2019-12-27 23:49:07,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:49:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 26625 states and 76895 transitions. [2019-12-27 23:49:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 23:49:07,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:07,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:07,242 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1806509476, now seen corresponding path program 1 times [2019-12-27 23:49:07,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:07,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003451328] [2019-12-27 23:49:07,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:07,348 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-27 23:49:07,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003451328] [2019-12-27 23:49:07,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:07,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:07,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [321240098] [2019-12-27 23:49:07,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:07,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:07,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-27 23:49:07,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:07,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:07,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:49:07,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:49:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:49:07,405 INFO L87 Difference]: Start difference. First operand 26625 states and 76895 transitions. Second operand 7 states. [2019-12-27 23:49:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:08,422 INFO L93 Difference]: Finished difference Result 37978 states and 107801 transitions. [2019-12-27 23:49:08,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:49:08,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-27 23:49:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:08,473 INFO L225 Difference]: With dead ends: 37978 [2019-12-27 23:49:08,473 INFO L226 Difference]: Without dead ends: 37930 [2019-12-27 23:49:08,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:49:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37930 states. [2019-12-27 23:49:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37930 to 34211. [2019-12-27 23:49:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34211 states. [2019-12-27 23:49:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34211 states to 34211 states and 97214 transitions. [2019-12-27 23:49:09,089 INFO L78 Accepts]: Start accepts. Automaton has 34211 states and 97214 transitions. Word has length 77 [2019-12-27 23:49:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:09,089 INFO L462 AbstractCegarLoop]: Abstraction has 34211 states and 97214 transitions. [2019-12-27 23:49:09,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:49:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34211 states and 97214 transitions. [2019-12-27 23:49:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 23:49:09,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:09,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:09,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1193959168, now seen corresponding path program 1 times [2019-12-27 23:49:09,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:09,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701472700] [2019-12-27 23:49:09,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:09,208 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-27 23:49:09,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701472700] [2019-12-27 23:49:09,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:09,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:49:09,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053284678] [2019-12-27 23:49:09,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:09,228 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:09,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-27 23:49:09,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:09,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:09,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:49:09,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:49:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:49:09,264 INFO L87 Difference]: Start difference. First operand 34211 states and 97214 transitions. Second operand 8 states. [2019-12-27 23:49:14,116 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 23:49:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:14,331 INFO L93 Difference]: Finished difference Result 108734 states and 306813 transitions. [2019-12-27 23:49:14,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 23:49:14,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-27 23:49:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:14,471 INFO L225 Difference]: With dead ends: 108734 [2019-12-27 23:49:14,471 INFO L226 Difference]: Without dead ends: 108497 [2019-12-27 23:49:14,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:49:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108497 states. [2019-12-27 23:49:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108497 to 68295. [2019-12-27 23:49:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68295 states. [2019-12-27 23:49:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68295 states to 68295 states and 194446 transitions. [2019-12-27 23:49:16,190 INFO L78 Accepts]: Start accepts. Automaton has 68295 states and 194446 transitions. Word has length 84 [2019-12-27 23:49:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:16,191 INFO L462 AbstractCegarLoop]: Abstraction has 68295 states and 194446 transitions. [2019-12-27 23:49:16,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:49:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 68295 states and 194446 transitions. [2019-12-27 23:49:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 23:49:16,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:16,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:16,223 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1304056769, now seen corresponding path program 1 times [2019-12-27 23:49:16,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:16,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384254162] [2019-12-27 23:49:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:16,299 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-27 23:49:16,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384254162] [2019-12-27 23:49:16,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:16,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:16,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385227955] [2019-12-27 23:49:16,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:16,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:16,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-27 23:49:16,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:16,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:16,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:49:16,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:49:16,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:49:16,349 INFO L87 Difference]: Start difference. First operand 68295 states and 194446 transitions. Second operand 4 states. [2019-12-27 23:49:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:16,595 INFO L93 Difference]: Finished difference Result 57569 states and 162218 transitions. [2019-12-27 23:49:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:49:16,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-27 23:49:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:16,674 INFO L225 Difference]: With dead ends: 57569 [2019-12-27 23:49:16,675 INFO L226 Difference]: Without dead ends: 57569 [2019-12-27 23:49:16,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-27 23:49:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57569 states. [2019-12-27 23:49:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57569 to 51593. [2019-12-27 23:49:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51593 states. [2019-12-27 23:49:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51593 states to 51593 states and 144975 transitions. [2019-12-27 23:49:17,385 INFO L78 Accepts]: Start accepts. Automaton has 51593 states and 144975 transitions. Word has length 84 [2019-12-27 23:49:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:17,385 INFO L462 AbstractCegarLoop]: Abstraction has 51593 states and 144975 transitions. [2019-12-27 23:49:17,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:49:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 51593 states and 144975 transitions. [2019-12-27 23:49:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:17,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:17,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:17,407 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1206420845, now seen corresponding path program 1 times [2019-12-27 23:49:17,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:17,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717515412] [2019-12-27 23:49:17,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:17,466 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-27 23:49:17,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717515412] [2019-12-27 23:49:17,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:17,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:49:17,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471033925] [2019-12-27 23:49:17,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:17,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:17,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:17,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:17,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:49:17,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:49:17,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:49:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:17,581 INFO L87 Difference]: Start difference. First operand 51593 states and 144975 transitions. Second operand 6 states. [2019-12-27 23:49:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:19,021 INFO L93 Difference]: Finished difference Result 106080 states and 299151 transitions. [2019-12-27 23:49:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:49:19,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-27 23:49:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:19,180 INFO L225 Difference]: With dead ends: 106080 [2019-12-27 23:49:19,180 INFO L226 Difference]: Without dead ends: 106080 [2019-12-27 23:49:19,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:49:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106080 states. [2019-12-27 23:49:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106080 to 59586. [2019-12-27 23:49:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59586 states. [2019-12-27 23:49:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59586 states to 59586 states and 167315 transitions. [2019-12-27 23:49:20,234 INFO L78 Accepts]: Start accepts. Automaton has 59586 states and 167315 transitions. Word has length 85 [2019-12-27 23:49:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:20,234 INFO L462 AbstractCegarLoop]: Abstraction has 59586 states and 167315 transitions. [2019-12-27 23:49:20,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:49:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 59586 states and 167315 transitions. [2019-12-27 23:49:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:20,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:20,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:20,260 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash -590530514, now seen corresponding path program 1 times [2019-12-27 23:49:20,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:20,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562111772] [2019-12-27 23:49:20,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:20,312 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-27 23:49:20,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562111772] [2019-12-27 23:49:20,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:20,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:20,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1434802667] [2019-12-27 23:49:20,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:20,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:20,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:20,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:20,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:49:20,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:49:20,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:49:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:49:20,682 INFO L87 Difference]: Start difference. First operand 59586 states and 167315 transitions. Second operand 7 states. [2019-12-27 23:49:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:21,335 INFO L93 Difference]: Finished difference Result 68929 states and 193095 transitions. [2019-12-27 23:49:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:49:21,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 23:49:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:21,442 INFO L225 Difference]: With dead ends: 68929 [2019-12-27 23:49:21,443 INFO L226 Difference]: Without dead ends: 68929 [2019-12-27 23:49:21,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:49:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68929 states. [2019-12-27 23:49:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68929 to 64207. [2019-12-27 23:49:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64207 states. [2019-12-27 23:49:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64207 states to 64207 states and 179761 transitions. [2019-12-27 23:49:22,276 INFO L78 Accepts]: Start accepts. Automaton has 64207 states and 179761 transitions. Word has length 85 [2019-12-27 23:49:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:22,276 INFO L462 AbstractCegarLoop]: Abstraction has 64207 states and 179761 transitions. [2019-12-27 23:49:22,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:49:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 64207 states and 179761 transitions. [2019-12-27 23:49:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:22,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:22,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:22,301 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 654233967, now seen corresponding path program 1 times [2019-12-27 23:49:22,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:22,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218503334] [2019-12-27 23:49:22,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:22,416 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-27 23:49:22,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218503334] [2019-12-27 23:49:22,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:22,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:22,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569510647] [2019-12-27 23:49:22,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:22,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:22,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:22,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:22,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:49:22,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:49:22,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:49:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:49:22,959 INFO L87 Difference]: Start difference. First operand 64207 states and 179761 transitions. Second operand 12 states. [2019-12-27 23:49:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:24,156 INFO L93 Difference]: Finished difference Result 91300 states and 248652 transitions. [2019-12-27 23:49:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:49:24,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2019-12-27 23:49:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:24,277 INFO L225 Difference]: With dead ends: 91300 [2019-12-27 23:49:24,277 INFO L226 Difference]: Without dead ends: 91300 [2019-12-27 23:49:24,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:49:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91300 states. [2019-12-27 23:49:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91300 to 79997. [2019-12-27 23:49:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79997 states. [2019-12-27 23:49:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79997 states to 79997 states and 219049 transitions. [2019-12-27 23:49:26,066 INFO L78 Accepts]: Start accepts. Automaton has 79997 states and 219049 transitions. Word has length 85 [2019-12-27 23:49:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:26,066 INFO L462 AbstractCegarLoop]: Abstraction has 79997 states and 219049 transitions. [2019-12-27 23:49:26,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:49:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 79997 states and 219049 transitions. [2019-12-27 23:49:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:26,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:26,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:26,102 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:26,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1422975376, now seen corresponding path program 1 times [2019-12-27 23:49:26,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:26,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509826741] [2019-12-27 23:49:26,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:26,216 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-27 23:49:26,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509826741] [2019-12-27 23:49:26,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:26,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:26,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478606488] [2019-12-27 23:49:26,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:26,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:26,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:26,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:26,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:49:26,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:49:26,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:49:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:49:26,500 INFO L87 Difference]: Start difference. First operand 79997 states and 219049 transitions. Second operand 12 states. [2019-12-27 23:49:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:27,912 INFO L93 Difference]: Finished difference Result 104011 states and 280700 transitions. [2019-12-27 23:49:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:49:27,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2019-12-27 23:49:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:28,060 INFO L225 Difference]: With dead ends: 104011 [2019-12-27 23:49:28,060 INFO L226 Difference]: Without dead ends: 104011 [2019-12-27 23:49:28,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:49:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104011 states. [2019-12-27 23:49:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104011 to 85406. [2019-12-27 23:49:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85406 states. [2019-12-27 23:49:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85406 states to 85406 states and 232008 transitions. [2019-12-27 23:49:29,771 INFO L78 Accepts]: Start accepts. Automaton has 85406 states and 232008 transitions. Word has length 85 [2019-12-27 23:49:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:29,772 INFO L462 AbstractCegarLoop]: Abstraction has 85406 states and 232008 transitions. [2019-12-27 23:49:29,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:49:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 85406 states and 232008 transitions. [2019-12-27 23:49:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:29,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:29,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:29,810 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1211624463, now seen corresponding path program 1 times [2019-12-27 23:49:29,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:29,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439037972] [2019-12-27 23:49:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:29,945 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-27 23:49:29,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439037972] [2019-12-27 23:49:29,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:29,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:49:29,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521258095] [2019-12-27 23:49:29,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:29,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:30,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:30,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:30,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:49:30,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:49:30,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:49:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:49:30,239 INFO L87 Difference]: Start difference. First operand 85406 states and 232008 transitions. Second operand 15 states. [2019-12-27 23:49:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:33,195 INFO L93 Difference]: Finished difference Result 113269 states and 306975 transitions. [2019-12-27 23:49:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:49:33,196 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-12-27 23:49:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:33,365 INFO L225 Difference]: With dead ends: 113269 [2019-12-27 23:49:33,365 INFO L226 Difference]: Without dead ends: 113269 [2019-12-27 23:49:33,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:49:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113269 states. [2019-12-27 23:49:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113269 to 103359. [2019-12-27 23:49:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103359 states. [2019-12-27 23:49:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103359 states to 103359 states and 280205 transitions. [2019-12-27 23:49:35,273 INFO L78 Accepts]: Start accepts. Automaton has 103359 states and 280205 transitions. Word has length 85 [2019-12-27 23:49:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:35,274 INFO L462 AbstractCegarLoop]: Abstraction has 103359 states and 280205 transitions. [2019-12-27 23:49:35,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:49:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 103359 states and 280205 transitions. [2019-12-27 23:49:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 23:49:35,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:35,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:49:35,311 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -324120782, now seen corresponding path program 1 times [2019-12-27 23:49:35,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:35,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121418785] [2019-12-27 23:49:35,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:35,397 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-27 23:49:35,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121418785] [2019-12-27 23:49:35,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:35,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:49:35,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6050044] [2019-12-27 23:49:35,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:35,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:35,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 317 transitions. [2019-12-27 23:49:35,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:35,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:49:35,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:49:35,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:49:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:35,535 INFO L87 Difference]: Start difference. First operand 103359 states and 280205 transitions. Second operand 6 states. [2019-12-27 23:49:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:35,780 INFO L93 Difference]: Finished difference Result 40542 states and 94495 transitions. [2019-12-27 23:49:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:49:35,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-27 23:49:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:35,848 INFO L225 Difference]: With dead ends: 40542 [2019-12-27 23:49:35,848 INFO L226 Difference]: Without dead ends: 35518 [2019-12-27 23:49:35,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:49:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35518 states. Received shutdown request... [2019-12-27 23:49:36,635 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:49:36,640 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:49:36,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:49:36 BasicIcfg [2019-12-27 23:49:36,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:49:36,643 INFO L168 Benchmark]: Toolchain (without parser) took 193467.17 ms. Allocated memory was 138.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,643 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.61 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.61 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,645 INFO L168 Benchmark]: Boogie Preprocessor took 44.82 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,645 INFO L168 Benchmark]: RCFGBuilder took 1123.44 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 93.6 MB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,646 INFO L168 Benchmark]: TraceAbstraction took 191403.21 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 93.6 MB in the beginning and 2.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 23:49:36,649 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.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.61 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.61 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.82 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1123.44 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 93.6 MB in the end (delta: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191403.21 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 93.6 MB in the beginning and 2.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: TIMEOUT, OverallTime: 191.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 75.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11955 SDtfs, 15717 SDslu, 29521 SDs, 0 SdLazy, 13919 SolverSat, 880 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 145 SyntacticMatches, 15 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 379531 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 273159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown